A hybrid multiobjective evolutionary algorithm for solving vehicle routing problem with time windows

DOI10.1007/s10589-005-3070-3zbMath1111.90022OpenAlexW1532651649MaRDI QIDQ2506187

Yanyan Li

Publication date: 28 September 2006

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-005-3070-3

zbMATH Keywords

multiobjective optimizationevolutionary algorithmsvehicle routing problems

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Traffic problems in operations research (90B20)

Related Items (16)

Solving multiobjective vehicle routing problem with stochastic demand via evolutionary computation ⋮ A knowledge-based evolutionary algorithm for the multiobjective vehicle routing problem with time windows ⋮ A decomposition based memetic algorithm for multi-objective vehicle routing problem with time windows ⋮ A bi-objective approach for scheduling ground-handling vehicles in airports ⋮ A min-max vehicle routing problem with split delivery and heterogeneous demand ⋮ High-level relay hybrid metaheuristic method for multi-depot vehicle routing problem with time windows ⋮ Multiobjective quantum evolutionary algorithm for the vehicle routing problem with customer satisfaction ⋮ An Investigation on Compound Neighborhoods for VRPTW ⋮ A hybrid ant colony optimization algorithm for a multi-objective vehicle routing problem with flexible time windows ⋮ From Single-Objective to Multi-Objective Vehicle Routing Problems: Motivations, Case Studies, and Methods ⋮ A multi-objective vehicle routing and scheduling problem with uncertainty in customers' request and priority ⋮ Multi-objective vehicle routing problems ⋮ A rank-dependent bi-criterion equilibrium model for stochastic transportation environment ⋮ An improved multi-objective evolutionary algorithm for the vehicle routing problem with time windows ⋮ Strategic timetable scheduling for last trains in urban railway transit networks ⋮ Penalty Rules in Multicriteria Genetic Search

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The vehicle routing problem: An overview of exact and approximate algorithms
• Vehicle routing with a sparse feasibility graph
• A parallel algorithm for the vehicle routing problem with time window constraints
• Evolution based learning in a job shop scheduling environment
• GRASP with a new local search scheme for vehicle routing problems with time windows
• A comparison of traditional and constraint-based heuristic methods on vehicle routing problems with side constraints
• Vehicle routing problem with time windows and a limited number of vehicles.
• Parallelization of a two-phase metaheuristic for routing problems with time windows
• Heuristics for large constrained vehicle routing problems
• Tabu search heuristics for the vehicle routing problem with time windows.
• A parallel hybrid genetic algorithm for the vehicle routing problem with time windows
• Simulated annealing metaheuristics for the vehicle routing problem with time windows
• Probabilistic diversification and intensification in local search for vehicle routing
• Lagrangian duality applied to the vehicle routing problem with time windows
• The Vehicle Routing Problem
• 2-Path Cuts for the Vehicle Routing Problem with Time Windows
• A Reactive Variable Neighborhood Search for the Vehicle-Routing Problem with Time Windows
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
• A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
• A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
• A Reactive Tabu Search Metaheuristic for the Vehicle Routing Problem with Time Windows
• A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows
• GVR: A New Genetic Representation for the Vehicle Routing Problem
• A guide to vehicle routing heuristics
• New heuristics for the Fleet Size and Mix Vehicle Routing Problem with Time Windows
• A greedy look-ahead heuristic for the vehicle routing problem with time windows
• A unified tabu search heuristic for vehicle routing problems with time windows
• A New Generation of Vehicle Routing Research: Robust Algorithms, Addressing Uncertainty
• The Vehicle Routing Problem with Time Windows Part I: Tabu Search
• The Vehicle Routing Problem with Time Windows Part II: Genetic Search
• Computer Solutions of the Traveling Salesman Problem
• Comparing descent heuristics and metaheuristics for the vehicle routing problem
• A heuristic for the vehicle routing problem with time windows
• Node-ejection chains for the vehicle routing problem: Sequential and parallel algorithms
• Solving vehicle routing problems using constraint programming and metaheuristics
• Genetic local search for multi-objective combinatorial optimization
• Using constraint-based operators to solve the vehicle routing problem with time windows

This page was built for publication: A hybrid multiobjective evolutionary algorithm for solving vehicle routing problem with time windows