Deriving Convergence of Vehicle Routing Problems using a Fictitious Play Approach

DOI10.1080/02522667.2007.10699785zbMath1279.90019OpenAlexW2317086818MaRDI QIDQ3534464

Silvio Nocera

Publication date: 3 November 2008

Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02522667.2007.10699785

zbMATH Keywords

heuristic

Mathematics Subject Classification ID

Noncooperative games (91A10) Transportation, logistics and supply chain management (90B06)

Cites Work

• D-Ants: Savings Based Ants divide and conquer the vehicle routing problem.
• BoneRoute: An adaptive memory-based method for effective fleet management
• A simple and effective evolutionary algorithm for the vehicle routing problem
• Fictitious play property for games with identical interests
• Very large-scale vehicle routing: new test problems, algorithms, and results
• A Subpath Ejection Method for the Vehicle Routing Problem
• A New Genetic Algorithm for the Quadratic Assignment Problem
• The Granular Tabu Search and Its Application to the Vehicle-Routing Problem
• Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems
• A Network Flow-Based Tabu Search Heuristic for the Vehicle Routing Problem
• An Exchange Heuristic for Routeing Problems with Time Windows
• A Fast Composite Heuristic for the Symmetric Traveling Salesman Problem
• A Fictitious Play Approach to Large-Scale Optimization
• Computer Solutions of the Traveling Salesman Problem

This page was built for publication: Deriving Convergence of Vehicle Routing Problems using a Fictitious Play Approach