Deriving Convergence of Vehicle Routing Problems using a Fictitious Play Approach

DOI10.1080/02522667.2007.10699785MaRDI QIDQ3534464zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Cooperative strong equilibrium in a vehicle routing game
• Publication:3204336
• The vehicle routing problem: An overview of exact and approximate algorithms
• Strong equilibria in the vehicle routing game
• A Fictitious Play Approach to Large-Scale Optimization

Cites work

• A Fast Composite Heuristic for the Symmetric Traveling Salesman Problem
• A Fictitious Play Approach to Large-Scale Optimization
• A Network Flow-Based Tabu Search Heuristic for the Vehicle Routing Problem
• A new genetic algorithm for the quadratic assignment problem
• A simple and effective evolutionary algorithm for the vehicle routing problem
• A subpath ejection method for the vehicle routing problem
• An Exchange Heuristic for Routeing Problems with Time Windows
• BoneRoute: An adaptive memory-based method for effective fleet management
• Computer Solutions of the Traveling Salesman Problem
• Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems
• D-Ants: Savings Based Ants divide and conquer the vehicle routing problem.
• Fictitious play property for games with identical interests
• The granular tabu search and its application to the vehicle-routing problem
• Very large-scale vehicle routing: new test problems, algorithms, and results

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

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