A decomposition based memetic algorithm for multi-objective vehicle routing problem with time windows

DOI10.1016/J.COR.2015.04.009MaRDI QIDQ337630zbMATH OpenOpenAlexFDO

Authors Yutao Qi, Zhanting Hou, He Li, Jianbin Huang, Xiaodong Li

Publication date 10 November 2016

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2015.04.009

zbMATH Keywords

decompositionmulti-objective optimizationvehicle routing problem with time windowsmemetic algorithm

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Transportation, logistics and supply chain management (90B06)

Recommendations

• A memetic algorithm for the vehicle routing problem with time windows
• A hybrid multiobjective evolutionary algorithm for solving vehicle routing problem with time windows
• An improved multi-objective evolutionary algorithm for the vehicle routing problem with time windows
• A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows
• A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem

Cites work

• A Route-Directed Hybrid Genetic Approach For The Vehicle Routing Problem With Time Windows
• A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
• A cooperative parallel meta-heuristic for the vehicle routing problem with time windows
• A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows
• A hybrid multiobjective evolutionary algorithm for solving vehicle routing problem with time windows
• A knowledge-based evolutionary algorithm for the multiobjective vehicle routing problem with time windows
• A memetic algorithm for a vehicle routing problem with backhauls
• A unified tabu search heuristic for vehicle routing problems with time windows
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• An improved multi-objective evolutionary algorithm for the vehicle routing problem with time windows
• Local search with annealing-like restarts to solve the VRPTW
• Probabilistic diversification and intensification in local search for vehicle routing
• Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
• Record breaking optimization results using the ruin and recreate principle
• The Vehicle Routing Problem with Time Windows Part II: Genetic Search
• Two Evolutionary Metaheuristics For The Vehicle Routing Problem With Time Windows
• Using constraint-based operators to solve the vehicle routing problem with time windows

Cited in

(7)

• A comprehensive risk assessment view on interval type-2 fuzzy controller for a time-dependent HazMat routing problem
• Using decomposition-based multi-objective algorithm to solve selective pickup and delivery problems with time windows
• Objectives and methods in multi-objective routing problems: a survey and classification scheme
• Improving neighborhood exploration into MOEA/D framework to solve a bi-objective routing problem
• A novel adaptive control strategy for decomposition-based multiobjective algorithm
• Optimizing logistics routings in a network perspective of supply and demand nodes
• A weighted-sum method for solving the bi-objective traveling thief problem

Describes a project that uses

Uses Software

• MOEA/D

This page was built for publication: A decomposition based memetic algorithm for multi-objective vehicle routing problem with time windows

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337630)