scholarly journals A two-phase Pareto local search heuristic for the bi-objective pollution-routing problem

Networks ◽  
2018 ◽  
Vol 72 (3) ◽  
pp. 311-336 ◽  
Author(s):  
Luciano Costa ◽  
Thibaut Lust ◽  
Raphael Kramer ◽  
Anand Subramanian
Keyword(s):  
Local Search ◽  
Two Phase ◽  
Routing Problem ◽  
Search Heuristic ◽  
Local Search Heuristic ◽  
Pareto Local Search ◽  
Pollution Routing Problem

Using cost change estimates in a local search heuristic for the pollution routing problem

OR Spectrum ◽  
2016 ◽  
Vol 39 (2) ◽  
pp. 557-587 ◽  
Author(s):  
Onur Can Saka ◽  
Sinan Gürel ◽  
Tom Van Woensel
Keyword(s):  
Local Search ◽  
Routing Problem ◽  
Search Heuristic ◽  
Local Search Heuristic ◽  
Pollution Routing Problem

Hybrid Iterative Local Search Heuristic with a Multiple Criteria Approach for the Vehicle Routing Problem

2011 ◽  
Vol 383-390 ◽  
pp. 4560-4567 ◽  
Author(s):  
D. R. Delgado Sobrino ◽  
Oliver Moravčik ◽  
D. Caganová ◽  
P. Kostal
Keyword(s):  
Local Search ◽  
Decision Criterion ◽  
Multiple Criteria ◽  
Neighborhood Search ◽  
Routing Problem ◽  
Local Optima ◽  
Search Heuristic ◽  
Local Search Heuristic ◽  
Search Heuristics ◽  
Construction Heuristic

This paper presents a Hybrid Iterative Local Search Heuristic and its framework, whose aim lies on helping to escape from local optima when a construction heuristic, for the VRP, has been trapped. The approach was mainly inspired by basic and modified versions of related successfully applied heuristics such as Variable Neighborhood Search (VNS) and Granular Local Search (GLS). Differently to a great deal of local search heuristics revised, which mainly consider a single decision criterion, multiple optimization criteria are considered all along the local search and a Multiple Criteria Threshold has been proposed allowing defining which arcs must be included in a candidate list to explore, this considerably reduces the search area and has a major incidence in the satisfaction of the clients. The proposal is enriched with a good literature review, taking into account some of the gaps and achievements of the states of the art and practice.

A guided local search heuristic for the capacitated arc routing problem

2003 ◽  
Vol 147 (3) ◽  
pp. 629-643 ◽  
Author(s):  
Patrick Beullens ◽  
Luc Muyldermans ◽  
Dirk Cattrysse ◽  
Dirk Van Oudheusden
Keyword(s):  
Local Search ◽  
Arc Routing ◽  
Guided Local Search ◽  
Routing Problem ◽  
Search Heuristic ◽  
Capacitated Arc Routing Problem ◽  
Local Search Heuristic ◽  
Capacitated Arc Routing

Adaptive granular local search heuristic for a dynamic vehicle routing problem

2009 ◽  
Vol 36 (11) ◽  
pp. 2955-2968 ◽  
Author(s):  
Rodrigo Moretti Branchini ◽  
Vinícius Amaral Armentano ◽  
Arne Løkketangen
Keyword(s):  
Local Search ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Dynamic Vehicle Routing ◽  
Dynamic Vehicle Routing Problem ◽  
Routing Problem ◽  
Search Heuristic ◽  
Local Search Heuristic
Sign in / Sign up

Export Citation Format

Share Document