A Genetic Algorithm for the Biobjective Traveling Salesman Problem with Profits

2008-07-01
Eryılmaz, Utkan
Karasakal, Esra
Show full item record
43
views
0
downloads
https://hdl.handle.net/11511/80738
28th Operations Research and Industrial Engineering National Conference, 1 - 03 Temmuz 2008
Unverified, Conference / Seminar

Suggestions

A genetic algorithm for the biobjective traveling salesman problem with profits
Karademir, Serdar; Süral, Haldun; Department of Industrial Engineering (2008)
In Traveling Salesman Problem (TSP) with profits, a profit is associated with each city and the requirement to visit all cities is removed. The purpose is to simultaneously minimize cost (excluding as many cities as possible) and maximize profit (including as many cities as possible). Although the reduced single-objective case of the problem has been well-studied, the true biobjective problem has been studied only by a few researchers. In this paper we study the true biobjective problem using the Multiobjec...
A genetic algorithm for the location-routing problem with time windows
Özgönenç, Hande; Meral, Fatma Sedef; Department of Industrial Engineering (2006)
The emphasis on minimizing the logistics costs to decrease overall system costs has led the researchers to consider the interdependencies between the decisions of locating facilities and planning the routes from those facilities. The location-routing problems considering this issue are the subject of this thesis study. A two-level hierarchical distribution system is considered in which goods are delivered from the sources (plants) to the facilities (depots) and then from the facilities to the customers. The...
A genetic algorithm for the uncapacitated single allocation planar hub location problem
Damgacioglu, Haluk; DİNLER, DERYA; Özdemirel, Nur Evin; İyigün, Cem (2015-10-01)
Given a set of n interacting points in a network, the hub location problem determines location of the hubs (transfer points) and assigns spokes (origin and destination points) to hubs so as to minimize the total transportation cost. In this study, we deal with the uncapacitated single allocation planar hub location problem (PHLP). In this problem, all flow between pairs of spokes goes through hubs, capacities of hubs are infinite, they can be located anywhere on the plane and are fully connected, and each s...
A genetic algorithm for the p-hub center problem with stochastic service level constraints
Eraslan Demirci, Şükran; Meral, Fatma Sedef; Department of Industrial Engineering (2010)
The emphasis on minimizing the costs and travel times in a network of origins and destinations has led the researchers to widely study the hub location problems in the area of location theory in which locating the hub facilities and designing the hub networks are the issues. The p-hub center problem considering these issues is the subject of this study. p-hub center problem with stochastic service level constraints and a limitation on the travel times between the nodes and hubs is addressed, which is an unc...
A genetic algorithm for the resource constrained project scheduling problem
Özleyen, Erdem; Sönmez, Rifat; Department of Civil Engineering (2011)
The resource-constrained project scheduling problem (RCPSP) aims to find a schedule of minimum makespan by starting each activity such that resource constraints and precedence constraints are respected. However, as the problem is NP-hard (Non-Deterministic Polynomial-Time Hard) in the strong sense, the performance of exact procedures is limited and can only solve small-sized project networks. In this study a genetic algorithm is proposed for the RCPSP. The proposed genetic algorithm (GA) aims to find near-o...
Citation Formats
U. Eryılmaz and E. Karasakal, “A Genetic Algorithm for the Biobjective Traveling Salesman Problem with Profits,” presented at the 28th Operations Research and Industrial Engineering National Conference, 1 - 03 Temmuz 2008, Türkiye, 2008, Accessed: 00, 2021. [Online]. Available: https://hdl.handle.net/11511/80738.
METU IIS - Integrated Information Service open@metu.edu.tr