Two-stage vehicle routing problem with arc time windows: A mixed integer programming formulation and a heuristic approach

•We consider two-stage vehicle routing problem with arc time windows.•We propose a MIP formulation and a heuristic approach based on memetic algorithm.•The MIP formulation obtains the optimal solution of small and medium-size problems.•The memetic algorithm obtains good quality solutions in a short...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:European journal of operational research Ročník 230; číslo 3; s. 539 - 550
Hlavní autori: Çetinkaya, Cihan, Karaoglan, Ismail, Gökçen, Hadi
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Amsterdam Elsevier B.V 01.11.2013
Elsevier
Elsevier Sequoia S.A
Predmet:
Formulations
Genetic algorithms
Heuristic
Heuristic methods
Integer programming
Linear programming
Logistics
Mathematical formulation
Mathematical models
Mathematical problems
Memetic algorithm
Military
Optimization
Route selection
Routing
Studies
Transportation problem (Operations research)
Vehicle routing problem with arc time windows
Vehicles
Windows (intervals)
Memetic algorithm
Vehicle routing problem with arc time windows
Mathematical formulation
Logistics
ISSN:0377-2217, 1872-6860
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:•We consider two-stage vehicle routing problem with arc time windows.•We propose a MIP formulation and a heuristic approach based on memetic algorithm.•The MIP formulation obtains the optimal solution of small and medium-size problems.•The memetic algorithm obtains good quality solutions in a short computation time. In this paper, we introduce a new variant of the Vehicle Routing Problem (VRP), namely the Two-Stage Vehicle Routing Problem with Arc Time Windows (TS_VRP_ATWs) which generally emerges from both military and civilian transportation. The TS_VRP_ATW is defined as finding the vehicle routes in such a way that each arc of the routes is available only during a predefined time interval with the objective of overall cost minimization. We propose a Mixed Integer Programming (MIP) formulation and a heuristic approach based on Memetic Algorithm (MA) to solve the TS_VRP_ATW. The qualities of both solution approaches are measured by using the test problems in the literature. Experimental results show that the proposed MIP formulation provides the optimal solutions for the test problems with 25 and 50 nodes, and some test problems with 100 nodes. Results also show that the proposed MA is promising quality solutions in a short computation time.
Bibliografia:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:0377-2217
1872-6860
DOI:10.1016/j.ejor.2013.05.001