Metaheuristic for the Vehicle Routing Problem with Backhauls and Time Windows

José Brandão ()
Additional contact information
José Brandão: Universidade do Minho

A chapter in Operations Research Proceedings 2017, 2018, pp 413-418 from Springer

Abstract: Abstract The vehicle in finding a set of routes, problem with backhauls and time windows contains two disjoint sets of customers: those that receive goods from the depot, who are called linehauls, and those that send goods to the depot, named backhauls. To each customer is associated an interval of time (time window), during which each one should be served. For solving this problem we created a deterministic iterated local search algorithm, which was tested using a large set of benchmark problems taken from the literature. These computational tests have proven that this algorithm competes with best known algorithms in terms of the quality of the solutions and computing time.

Keywords: Backhauls; Linehauls; Logistics; Time windows; Vehicle routing (search for similar items in EconPapers)
Date: 2018
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

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:oprchp:978-3-319-89920-6_55

Ordering information: This item can be ordered from
http://www.springer.com/9783319899206

DOI: 10.1007/978-3-319-89920-6_55

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().