A genetic algorithm for the location-routing problem with time windows

Download

index.pdf

Date

2006

Author

Özgönenç, Hande

Metadata

Show full item record

Item Usage Stats

203
views

62
downloads

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 facilities are uncapacitated and operate within the shift times defined. The goods are to be delivered to the customers within their time windows by the vehicles that are capacitated. Both a mathematical model and a genetic algorithm based heuristic solution approach are proposed for this problem. We discuss the problem specific issues integrated with the general framework of the genetic algorithm applications. The computational studies are realized on a number of test problems. The results indicate that the genetic algorithm based heuristic gives satisfactory results compared with a sequential solution methodology.

Subject Keywords

Systems Engineering.

URI

http://etd.lib.metu.edu.tr/upload/3/12607395/index.pdf
https://hdl.handle.net/11511/16240

Collections

Graduate School of Natural and Applied Sciences, Thesis

Suggestions

OpenMETU
Core

An exact and a heuristic approach for the transportation-p-facility location problem Das, Soumen Kumar; Roy, Sankar Kumar; Weber, Gerhard Wilhelm (Springer Science and Business Media LLC, 2020-01-30) The delineation of the transportation network is a strategic issue for all over the place. The problem of locating new facilities among several existing facilities and minimizing the total transportation cost are the main topics of the location network system. This paper addresses the transportation-p-facility location problem (T-p-FLP) which makes a connection between the facility location problem and the transportation problem, where p corresponds to the number of facilities. The T-p-FLP is a generalizati...
New approaches for performance evaluation using data envelopment analysis Özpeynirci, Nail Özgür; Köksalan, Murat; Department of Industrial Engineering (2004) Data Envelopment Analysis (DEA) assigns efficiency values to decision making units (DMU) in a given period by comparing the outputs with the inputs. In many applications, inputs and outputs of DMUs are monitored over time. There might be a time lag between the consumption of inputs and production of outputs. We develop approaches that aim to capture the time lag between the outputs and the inputs in assigning the efficiency values to DMUs. We present computational results on randomly generated problems as w...
Development of of a safety performance index assessment tool by using a fuzzy structural equation model for construction sites Gunduz, Murat; Birgönül, Mustafa Talat; Ozdemir, Mustafa (Elsevier BV, 2018-01-01) The main goal of this study is to propose a safety performance index assessment tool to improve the construction safety. Formulation of the safety performance index of construction sites is achieved upon a validated multidimensional safety performance model. The contribution of this study could be summarized as incorporation of fuzzy set theory into structural equation modeling to develop a safety performance index assessment software tool. Case studies were conducted at 11 international construction sites ...
A Lagrangean relaxation based approach for the capacity allocation problem in flexible manufacturing systems ÖZPEYNİRCİ, SELİN; Azizoğlu, Meral (Informa UK Limited, 2010-05-01) This study considers the operation assignment and capacity allocation problem in flexible manufacturing systems. A set of operations is selected to be processed and assigned to the machines together with their required tools. The purchase or usage of the required tools incurs a cost. The machines have scarce time and tool magazine capacities. The objective is to maximize the total weight of the assigned operations minus the total tooling costs. We use Lagrangean relaxation approach to obtain upper and lower...
Scheduling with latest arrival consolidation in service network design problems Yiğit, Aybeniz; Sepil, Canan; Department of Industrial Engineering (2014) In this thesis, we consider the service network design problem of a ground transportation based delivery system, in which routes of demands of commodities between any origin-destination pair are determined. A commodity can be sent from its origin to its destination through direct delivery, however such a routing would not effectively make use of the vehicles used for transportation. To benefit from economies of scale, a networking policy based on consolidation is generally applied in service networks. We co...

Citation Formats

H. Özgönenç, “A genetic algorithm for the location-routing problem with time windows,” M.S. - Master of Science, Middle East Technical University, 2006.