Deriving Convergence of Vehicle Routing Problems using a Fictitious Play Approach
From MaRDI portal
Publication:3534464
DOI10.1080/02522667.2007.10699785zbMATH Open1279.90019OpenAlexW2317086818MaRDI QIDQ3534464FDOQ3534464
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
Recommendations
Cites Work
- BoneRoute: An adaptive memory-based method for effective fleet management
- D-Ants: Savings Based Ants divide and conquer the vehicle routing problem.
- A simple and effective evolutionary algorithm for the vehicle routing problem
- An Exchange Heuristic for Routeing Problems with Time Windows
- Fictitious play property for games with identical interests
- A Fictitious Play Approach to Large-Scale Optimization
- Very large-scale vehicle routing: new test problems, algorithms, and results
- Computer Solutions of the Traveling Salesman Problem
- The granular tabu search and its application to the vehicle-routing problem
- A new genetic algorithm for the quadratic assignment problem
- Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems
- A Fast Composite Heuristic for the Symmetric Traveling Salesman Problem
- A subpath ejection method for the vehicle routing problem
- A Network Flow-Based Tabu Search Heuristic for the Vehicle Routing Problem
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)
