Multi-Swarm Optimization for Dynamic Combinatorial Problems: A Case Study on Dynamic Vehicle Routing Problem
- 1 January 2010
- book chapter
- Published by Springer Nature
- p. 227-238
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- A particle swarm optimization for the vehicle routing problem with simultaneous pickup and deliveryComputers & Operations Research, 2009
- Dynamic vehicle routing using genetic algorithmsApplied Intelligence, 2007
- Particle Swarm Optimization in Dynamic Environments2007
- Explicit Memory Schemes for Evolutionary Algorithms in Dynamic Environments2007
- Ant Colony System for a Dynamic Vehicle Routing ProblemJournal of Combinatorial Optimization, 2005
- Online Stochastic and Robust OptimizationLecture Notes in Computer Science, 2004
- Multi-swarm Optimization in Dynamic Environments2004
- Node-ejection chains for the vehicle routing problem: Sequential and parallel algorithmsParallel Computing, 2001
- Dynamic vehicle routing: Status and prospectsAnnals of Operations Research, 1995
- Computer Solutions of the Traveling Salesman ProblemBell System Technical Journal, 1965