A new bilevel formulation for the vehicle routing problem and a solution method using a genetic algorithm
From MaRDI portal
Publication:2465483
DOI10.1007/s10898-006-9094-0zbMath1145.90010OpenAlexW2062512894MaRDI QIDQ2465483
Athanasios Migdalas, Yannis Marinakis, Panos M. Pardalos
Publication date: 4 January 2008
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-006-9094-0
Hierarchical games (including Stackelberg games) (91A65) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Genetics and epigenetics (92D10)
Related Items
Multiple phase neighborhood search---GRASP based on Lagrangean relaxation, random backtracking Lin-Kernighan and path relinking for the TSP, A tabu search algorithm to solve a green logistics bi-objective bi-level problem, Metaheuristics for bilevel optimization: a comprehensive review, The school bus routing problem with student choice: a bilevel approach and a simple and effective metaheuristic, The Real-Time Vehicle Routing Problem, Modeling uncertain passenger arrivals in the elevator dispatching problem with destination control, A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints, Honey bees mating optimization algorithm for large scale vehicle routing problems, Heuristic solution approaches for the cumulative capacitated vehicle routing problem, Parametric integer programming algorithm for bilevel mixed integer programs, Global versus local search: the impact of population sizes on evolutionary algorithm performance, A study on the use of heuristics to solve a bilevel programming problem, Approximation algorithms for the load-balanced capacitated vehicle routing problem, Real-time algorithms for the bilevel double-deck elevator dispatching problem, An application of genetic algorithm to a bidding problem in electricity markets, An integer linear programming model for efficient scheduling of UGV tasks in precision agriculture under human supervision, Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography, Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multiple phase neighborhood search---GRASP based on Lagrangean relaxation, random backtracking Lin-Kernighan and path relinking for the TSP
- A tabu search algorithm for the vehicle routing problem
- D-Ants: Savings Based Ants divide and conquer the vehicle routing problem.
- Solving the vehicle routing problem with adaptive memory programming methodology
- An improved ant system algorithm for the vehicle routing problem
- BoneRoute: An adaptive memory-based method for effective fleet management
- A genetic algorithm for the vehicle routing problem
- A simple and effective evolutionary algorithm for the vehicle routing problem
- Probabilistic diversification and intensification in local search for vehicle routing
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
- Very large-scale vehicle routing: new test problems, algorithms, and results
- Expanding neighborhood GRASP for the traveling salesman problem
- A hybrid genetic-GRASP algorithm using Lagrangean relaxation for the traveling salesman problem
- The Vehicle Routing Problem
- A Subpath Ejection Method for the Vehicle Routing Problem
- The Granular Tabu Search and Its Application to the Vehicle-Routing Problem
- Parallel iterative search methods for vehicle routing problems
- A Network Flow-Based Tabu Search Heuristic for the Vehicle Routing Problem
- A Backtracking Adaptive Threshold Accepting Algorithm for the Vehicle Routing Problem
- A List Based Threshold Accepting Algorithm for the Capacitated Vehicle Routing Problem
- A guide to vehicle routing heuristics
- A Tabu Search Heuristic for the Vehicle Routing Problem
- Computer Solutions of the Traveling Salesman Problem
- The Traveling-Salesman Problem and Minimum Spanning Trees
- Using experimental design to find effective parameter settings for heuristics
- Variable neighborhood search: Principles and applications
- Node-ejection chains for the vehicle routing problem: Sequential and parallel algorithms
