An evolutionary algorithm to the two-echelon location routing problems with hard time windows

Download

12626118.pdf

Date

2021-2-10

Author

Müslim, Melissa

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

322
views

271
downloads

Rapid growth in freight distribution networks due to increasing demand created the necessity for effective and efficient methods for freight vehicle movements. Motivated by the effective distribution network design problems, a two-echelon location routing problem with hard time windows (2E-LRPTW) is studied. This problem combines two NP-Hard problems, including strategic and tactical decisions: the facility location problem (FLP) and the vehicle routing problem (VRP). In this study, the first echelon consists of city distribution centers (CDC) and satellites; the second echelon is constituted of interaction between satellites and customers. The network is connected through two types of vehicle fleets with different characteristics. Each type of vehicle leaves the corresponding facility during working hours and returns to it. Imposing capacity restrictions to both facilities and vehicles and adding hard time window constraints to customers, the problem complexity increases. Consequently, an evolutionary algorithm (EA) inspired by a genetic algorithm is proposed to solve large-size instances with good quality within a reasonable time. The EA decides which facilities to open, allocations, and resulting routes originated from each facilv ity at both echelons. Computational experiments and results indicate the proposed EA capable of finding optimal solutions and improving the best-known solutions for some instances.

Subject Keywords

Location-routing problem with time windows, Vehicle routing, Genetic algorithm, Evolutionary algorithm

URI

https://hdl.handle.net/11511/89591

Collections

Graduate School of Natural and Applied Sciences, Thesis

Suggestions

OpenMETU
Core

A new algorithm and computation approach for economic dispatch with prohibited operating zones in power systems Cetinkaya, N; Urkmez, A; Erkmen, İsmet; Yalcinoz, T (2005-01-01) This paper presents a new algorithm and computation approach to solve the economic load dispatch (ELD) in electrical power systems. We applied a new power formula to solve the LLD problem. If production units cost Curves are represented property then ELD becomes More Correct. In this respect we assumed that production units have prohibited operating zones. Cost curves of the production units are generally accepted as piece-wise quadratic function. The power production is cheaper since we do not use the prod...
A multi-phase heuristic for the production routing problem Solyali, Oguz; Süral, Haldun (2017-11-01) This study considers the production routing problem where a plant produces and distributes a single item to multiple retailers over a multi-period time horizon. The problem is to decide on when and how much to produce and stock at the plant, when and how much to serve and stock at each retailer, and vehicle routes for shipments such that the sum of fixed production setup cost, variable production cost, distribution cost, and inventory carrying cost at the plant and retailers is minimized. A multi-phase heur...
A hybrid genetic algorithm for the discrete time-cost trade-off problem Sönmez, Rifat (2012-10-01) In this paper we present a hybrid strategy developed using genetic algorithms (GAs), simulated annealing (SA), and quantum simulated annealing techniques (QSA) for the discrete time-cost trade-off problem (DTCTP). In the hybrid algorithm (HA), SA is used to improve hill-climbing ability of GA. In addition to SA, the hybrid strategy includes QSA to achieve enhanced local search capability. The HA and a sole GA have been coded in Visual C++ on a personal computer. Ten benchmark test problems with a range of 1...
A column generation approach for the location-routing problem with time windows Farham, Mohammad Saleh; Süral, Haldun; İyigün, Cem (2018-02-01) The location-routing problem with time windows consists of opening a subset of depots, assigning customers to depots, and determining routes within allowable times such that the sum of depot opening, vehicle usage, and traveling costs is minimized. Customers have to be visited only once during their time windows and depot capacities and load limits of vehicles cannot be violated. In order to find the exact solution to the problem, we propose a branch-and-price algorithm based on set-partitioning approach. T...
A High Performance PWM Algorithm for Common Mode Voltage Reduction in Three-phase Voltage Source Inverters Uen, Emre; Hava, Ahmet Masum (2008-06-19) A high performance PWM algorithm with reduced common mode voltage (CMV) and satisfactory overall performance is proposed for three-phase PWM inverter drives. The algorithm combines the near state PWM (NSPWM) method which has superior overall performance characteristics at high modulation index and MAZSPWM, a modified form of the active zero state PWM method (AZSPWM1), which is suitable for low modulation index range of operation. Since AZSPWM1 has line-to-line voltage pulse reversals with small zero-voltage...

Citation Formats

M. Müslim, “An evolutionary algorithm to the two-echelon location routing problems with hard time windows,” M.S. - Master of Science, Middle East Technical University, 2021.