Exploring Feasible and Infeasible Regions in the Vehicle Routing Problem with Time Windows Using a Multi-objective Particle Swarm Optimization Approach

@inproceedings{Gutirrez2008ExploringFA,
  title={Exploring Feasible and Infeasible Regions in the Vehicle Routing Problem with Time Windows Using a Multi-objective Particle Swarm Optimization Approach},
  author={Juan Pedro Castro Guti{\'e}rrez and Dario Landa Silva and Jos{\'e} A. Moreno-P{\'e}rez},
  booktitle={NICSO},
  year={2008}
}
This paper investigates the ability of a discrete particle swarm optimization algorithm (DPSO) to evolve solutions from infeasibility to feasibility for the Vehicle Routing Problem with Time Windows (VRPTW). The proposed algorithm incorporates some principles from multi-objective optimization to allow particles to conduct a dynamic trade-off between objectives in order to reach feasibility. The main contribution of this paper is to demonstrate that without incorporating tailored heuristics or… CONTINUE READING
12 Citations
23 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 12 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 23 references

Jumping Frogs Optimization: a new swarm method for discrete optimization

  • F. Javier Martinez Garcia, Jose A. Moreno Perez
  • Documentos de Trabajo del DEIOC. N
  • 2008
3 Excerpts

Similar Papers

Loading similar papers…