Local search based metaheuristics for the robust vehicle routing problem with discrete scenarios

Elyn L. Solano‐Charris; Christian Prins; Andréa Cynthia Santos

doi:10.1016/j.asoc.2015.03.058

ScienceGate Book Chapters

JOURNAL ARTICLE

Local search based metaheuristics for the robust vehicle routing problem with discrete scenarios

Elyn L. Solano‐Charris Christian Prins Andréa Cynthia Santos

Year: 2015 Journal: Applied Soft Computing Vol: 32 Pages: 518-531 Publisher: Elsevier BV

DOI: 10.1016/j.asoc.2015.03.058

Get Full-Text PDF Get Analytical Report

Keywords:

Iterated local search Metaheuristic Mathematical optimization Heuristics Vehicle routing problem Greedy randomized adaptive search procedure Local search (optimization) Computer science Lexicographical order Set (abstract data type) Benchmark (surveying) Heuristic Greedy algorithm Mathematics Algorithm Routing (electronic design automation) Combinatorics

Metrics

Cited By

6.54

FWCI (Field Weighted Citation Impact)

Refs

0.96

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Vehicle Routing Optimization Methods

Physical Sciences → Engineering → Industrial and Manufacturing Engineering

Transportation and Mobility Innovations

Physical Sciences → Engineering → Automotive Engineering

Transportation Planning and Optimization

Social Sciences → Social Sciences → Transportation

Local search based metaheuristics for the robust vehicle routing problem with discrete scenarios

Metrics

Citation History

Topics

Related Documents

Local search-based metaheuristics for the split delivery vehicle routing problem

Local search metaheuristics for Capacitated Vehicle Routing Problem: a comparative study

Local search-based metaheuristics for the robust distributed permutation flowshop problem

Cooperative Parallel Metaheuristics based Penguin Optimization Search for Solving the Vehicle Routing Problem

A robust algorithm based on Differential Evolution with local search for the Capacitated Vehicle Routing Problem