Filters








1,457 Hits in 7.0 sec

A two-phase hybrid metaheuristic for the vehicle routing problem with time windows

Jörg Homberger, Hermann Gehring
2005 European Journal of Operational Research  
This paper describes the parallelization of a two-phase metaheuristic for the vehicle routing problem with time windows and a central depot (VRPTW).  ...  The parallelized two-phase metaheuristic was subjected a comparative test on the basis of 356 problems from the literature with sizes varying from 100 to 1000 customers.  ...  Introduction and problem formulation The vehicle routing problem with time windows (VRPTW) is an extension of the well-known vehicle routing problem (VRP). It can be described as follows (cf.  ... 
doi:10.1016/j.ejor.2004.01.027 fatcat:dciu6dvxdvcvzd2jtcqm2orx4y

Page 941 of The Journal of the Operational Research Society Vol. 60, Issue 7 [page]

2009 The Journal of the Operational Research Society  
A two-phase hybrid metaheuristic for the vehicle routing problem with time windows. Eur J Opl Res 162: 220-238. Kyt6joki J, Nuortio T, Braysy O and Gendreau M (2007).  ...  A parallel hybrid genetic algorithm for the vehicle routing problem with time windows. Comput Opns Res 31: 2037-2053. Braysy O and Gendreau M (2005a).  ... 

A survey on pickup and delivery problems

Sophie N. Parragh, Karl F. Doerner, Richard F. Hartl
2008 Journal für Betriebswirtschaft  
This paper is the second part of a comprehensive survey on routing problems involving pickups and deliveries. Basically, two problem classes can be distinguished.  ...  Single as well as multi vehicle mathematical problem formulations for all three VRPPD types are given, and the respective exact, heuristic, and metaheuristic solution methods are discussed.  ...  We thank the researchers working in the field of transportation logistics for their various contributions.  ... 
doi:10.1007/s11301-008-0036-4 fatcat:wv5idhicxvdvvmntj36f5mnpqq

Vehicle Routing Problem with Time Windows, Part II: Metaheuristics

Olli Bräysy, Michel Gendreau
2005 Transportation Science  
T his paper surveys the research on the metaheuristics for the Vehicle Routing Problem with Time Windows (VRPTW).  ...  The VRPTW can be described as the problem of designing least cost routes from one depot to a set of geographically scattered points.  ...  supported by the Emil Aaltonen Foundation, the Canadian Natural Science and Engineering Research Council, Liikesivistysrahasto and Volvo Foundations, and the TOP project funded by the Research Council of  ... 
doi:10.1287/trsc.1030.0057 fatcat:76maqrz7q5cgpgk5dlb6zuxl44

An annotated bibliography of GRASP - Part I: Algorithms

Paola Festa, Mauricio G. C. Resende
2009 International Transactions in Operational Research  
A greedy randomized adaptive search procedure (GRASP) is a metaheuristic for combinatorial optimization.  ...  It is a multi-start or iterative process, in which each GRASP iteration consists of two phases, a construction phase, in which a feasible solution is produced, and a local search phase, in which a local  ...  Improved GRASP with tabu search for vehicle routing with both time window and limited number of vehicles. In Orchard, B., Yang, C., Ali, M.  ... 
doi:10.1111/j.1475-3995.2009.00663.x fatcat:gqolwm2hafgzlfdckt7kblixgu

Vehicle routing with time windows: An overview of exact, heuristic and metaheuristic methods

Nasser A. El-Sherbeny
2010 Journal of King Saud University: Science  
In this paper, we present a review with some limited of exacts, heuristics and metaheuristics methods for the vehicle routing problem time windows (VRPTW).  ...  In this period a number of papers have been published on the exact, heuristics and metaheursitics methods of the routing problem with time windows.  ...  Acknowledgment The author would like to thank an anonymous referee for some useful comments.  ... 
doi:10.1016/j.jksus.2010.03.002 fatcat:ah3tqi36cjgwnjkmq4bia4umsm

Variable Neighborhood Search based Set Covering ILP Model for the Vehicle Routing Problem with Time Windows

Amine Dhahri, Kamel Zidi, Khaled Ghedira
2014 Procedia Computer Science  
In this paper we propose a hybrid metaheuristic based on General Variable Neighborhood search and Integer Linear Programming for solving the vehicle routing problem with time windows (VRPTW).  ...  The problem consists in determining the minimum cost routes for a homogeneous fleet of vehicles to meet the demand of a set of customers within a specified time windows.  ...  Routing Problem with Time Windows (VRPTW).  ... 
doi:10.1016/j.procs.2014.05.076 fatcat:hnl2ozgg7navlpcxz4gzs3pjqe

An overview of a heuristic for vehicle routing problem with time windows

Fuh-hwa Franklin Liu, Sheng-yuan Shen
1999 Computers & industrial engineering  
In this paper, a two-stage metaheuristic based on a new neighborhood structure is proposed to solve the vehicle routing problem with time windows.  ...  Unlike the conventional methods for parallel route construction, we construct mutes in a nested parallel manner to obtain higher solution quality.  ...  The purpose of this paper is to develop a method in solving the vehicle routing problem with time windows (VRPTW) so that either the obtainment of high quality fast-solution or an attempt in finding the  ... 
doi:10.1016/s0360-8352(99)00086-8 fatcat:zbchnh42g5h7bfrlzoq7ln3aou

A metaheuristic for the vehicle-routeing problem with soft time windows

W-C Chiang, R A Russell
2004 Journal of the Operational Research Society  
of Tulsa, Tulsa, OK, USA This paper develops a metaheuristic for the vehicle-routeing and scheduling problem with soft time window constraints.  ...  In this paper, we develop a metaheuristic for solving the vehicle-routeing problem with soft time windows (VRPSTW).  ... 
doi:10.1057/palgrave.jors.2601791 fatcat:j3uudp6kffhe7c576r3wvcbmei

Data Mining based Hybridization of Meta-RaPS

Fatemah Al-Duoli, Ghaith Rabadi
2014 Procedia Computer Science  
Problem [9] , the Spatial Scheduling Problem with Release Times [10] , and the Aerial Refueling Scheduling Problem with Due Data to Deadline Windows and Release Time [11] .  ...  The performance of the previous group of solutions is accounted for using a moving average of a predefined window size (avg%).  ... 
doi:10.1016/j.procs.2014.09.097 fatcat:kisssawpcbhv5pixhqdm2zihzq

School bus Routing Problem: Contemporary Trends and Research Directions

William A. Ellegood, Stanislaus Solomon, Jeremy North, James F. Campbell
2019 Omega : The International Journal of Management Science  
Acknowledgements This research was supported by the Summer Research Grant provided by the College of Business Administration -Sam Houston State University.  ...  [5] implement a two-phase approach, with a clustering heuristic to group stops and an ACO metaheuristic to route each cluster.  ...  For construction heuristics in bus route generation, about 38% used a "two-phase" method.  ... 
doi:10.1016/j.omega.2019.03.014 fatcat:sfldjf3l4vamnfdp5747bcq5la

A route-neighborhood-based metaheuristic for vehicle routing problem with time windows

Fuh-Hwa Franklin Liu, Sheng-Yuan Shen
1999 European Journal of Operational Research  
In this paper, a two-stage metaheuristic based on a new neighborhood structure is proposed to solve the vehicle routing problem with time windows (VRPTW).  ...  Unlike the conventional methods for parallel route construction, we construct routes in a nested parallel manner to obtain higher solution quality.  ...  Russell for providing the paper of the reactive tabu search metaheuristic, George Kontoravdis for providing the 249 and 417 customer problem sets.  ... 
doi:10.1016/s0377-2217(98)00315-4 fatcat:tqqrc77o6rcnfednb3rvldeq7y

Metaheuristics for The Solution of Dynamic Vehicle Routing Problem With Time Windows (DVRPTW) With Travel Time Variable

Nurlita Gamayanti
2017 JAREE (Journal on Advanced Research in Electrical Engineering)  
This research is focusing on the development of metaheuristic algorithm to solve Dynamic Vehicle Routing Problem With Time Windows (DVRPTW) for the service provider of Inter-city Courier.  ...  In DVRPTW, vehicle's routes are raised dynamically based on real time information, for example the reception of new order.  ...  In this research, we solve the routing and scheduling problem in dynamic vehicle routing problem with time windows (DVRPTW) in Inter-City Courier, where vehicles leave from depo, visit a group of consumer  ... 
doi:10.12962/j25796216.v1.i1.13 fatcat:5o7zvfoprrhebfagq6o27elnl4

A Survey on the Vehicle Routing Problem and Its Variants

Suresh Nanda Kumar, Ramasamy Panneerselvam
2012 Intelligent Information Management  
In this paper, we have conducted a literature review on the recent developments and publications involving the vehicle routing problem and its variants, namely vehicle routing problem with time windows  ...  Hence, the use of exact optimization methods may be difficult to solve these problems in acceptable CPU times, when the problem involves real-world data sets that are very large.  ...  The authors [37] propose a real-time time-dependent vehicle routing problem with time windows.  ... 
doi:10.4236/iim.2012.43010 fatcat:bhzk37ixjnevhfj3shywxc2ccq

A Time-Dependent Vehicle Routing Problem with Time Windows for E-Commerce Supplier Site Pickups Using Genetic Algorithm

Suresh Nanda Kumar, Ramasamy Panneerselvam
2015 Intelligent Information Management  
A literature review of VRPTW, TDVRP, and a metaheuristic such as the genetic algorithm was conducted.  ...  To get solutions in determining routes which are realistic and very close to the actual solution, we use heuristics and metaheuristics which are of the combinatorial optimization type.  ...  The authors also wish to thank the reviewers of the paper for their very constructive and objective feedback and suggestions, which have been incorporated in this paper.  ... 
doi:10.4236/iim.2015.7474015 fatcat:g3ihhoczgraopbw6tumrer6lre
« Previous Showing results 1 — 15 out of 1,457 results