Solving Multi-Objective Multi-Constraint Optimization Problems using Hybrid Ants System and Tabu Search

@inproceedings{Chuin2003SolvingMM,
  title={Solving Multi-Objective Multi-Constraint Optimization Problems using Hybrid Ants System and Tabu Search},
  author={Hoong Chuin and Min Kwang Lim and Wee Chong Wan and WU Xiaotao},
  year={2003}
}
Many real-world optimization problems today are multi-objective multi-constraint generalizations of NP-hard problems. A classic case we study in this paper is the Inventory Routing Problem with Time Windows (IRPTW). IRPTW considers inventory costs across multiple instances of Vehicle Routing Problem with Time Windows (VRPTW). The latter is in turn extended with time-windows constraints from the Vehicle Routing Problem (VRP), which is extended with optimal fleet size objective from the single… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-9 of 9 references

A Metaheuristic for the Pickup and Delivery Problem with Time Windows

  • Li, Lim 2001 H. Li, A. Lim
  • IEEE Int’l Conf on Tools with Artificial…
  • 2001

and T

  • J. Schulze
  • Fahle, A Parallel Algorithm for the Vehicle…
  • 1997
2 Excerpts

Solving an Integrated Logistics Problem Arising in Grocery Distribution

  • M. W. Carter, J. M. Farvolden, G. Laporte, J. Xu
  • INFOR, Vol 34:4, pp. 290-306
  • 1996
2 Excerpts

Similar Papers

Loading similar papers…