GRASP with a New Local Search Scheme for Vehicle Routing Problems with Time Windows

Wanpracha Chaovalitwongse (), Dukwon Kim () and Panos M. Pardalos ()
Additional contact information
Wanpracha Chaovalitwongse: University of Florida
Dukwon Kim: University of Tennessee
Panos M. Pardalos: University of Florida

Journal of Combinatorial Optimization, 2003, vol. 7, issue 2, No 5, 179-207

Abstract: Abstract The NP-Hard Vehicle Routing Problem with Time Windows (VRPTW) is one of the major transportation problems. In this paper, a Greedy Randomized Adaptive Search Procedure (GRASP) for VRPTW is discussed for minimizing the fleet size and the travel distance. There are two phases within each GRASP iteration: construction phase and local search phase. In the construction phase, the initial solution is computed by applying an adaptive randomized greedy function. In the local search phase, the search procedure is applied to the constructed initial solution obtained by the construction phase for an improvement. In this paper, we propose an improved solution technique by using new local search ideas and new lower bounding procedures. In addition, we report computational results and address some practical issues in this area.

Keywords: vehicle routing with time windows; greedy randomized adaptive search procedure; local search (search for similar items in EconPapers)
Date: 2003
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://link.springer.com/10.1023/A:1024427114516 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:7:y:2003:i:2:d:10.1023_a:1024427114516

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1023/A:1024427114516

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().