Abstract
Classical models of combinatorial problems, such as scheduling, play a key role in optimization research as they allow theoretical and empirical work to focus on core issues of problem solving performance. By their very nature, however, classical models are a simplification of real-world problems. We argue that the challenge now is to address those real-world features that were simplified away in the classical models, and that in order to do this we should investigate how problem features affect solution technologies. In this paper, we perform an empirical study of vehicle routing problems (VRPs) and job shop scheduling problems (JSPs) using commercially available constraint-based optimization software, ILOG Dispatcher, and ILOG Scheduler. We start with instances of the classical VRP and JSP and systematically make the two problems more realistic by removing the simplifying assumptions of the classical models. While doing so, we empirically investigate the key problem characteristics that make the problems more amenable to one solution technique or the other. We[-5pc] argue that our observations are symptomatic of the underlying technologies used in the employed software.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Baptiste, Ph. and C. Le Pape, “Edge finding constraint propagation algorithms for disjunctive and cumulative scheduling,” in Proceedings of the Fifteenth Workshop of the U.K. Planning Special Interest Group, 1996.
Baptiste, Ph., C. Le Pape, and W. Nuijten, Constraint-based scheduling: Applying constraint programming to scheduling problems, Kluwer Academic Publishers, 2001.
Beck, J. C. and M. S. Fox, “Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics,” Artificial Intelligence, 117(1), 31–81 (2000).
Beck, J. C. and P. Refalo, “A hybrid approach to scheduling with earliness and tardiness costs,” Annals of Operations Research, 118, 49–71 (2003).
Beck, J. C., A. J. Davenport, and M. S. Fox, “Five pitfalls of empirical scheduling research,” in 3rd Int. Conference on Principles and Practice of Constraint Programming (CP’97), 1997.
Beck, J. C. and L. Perron, “Discrepancy-bounded depth first search,” in Proceedings of the Second International Workshop on Integration of AI and OR Technologies for Combinatorial Optimization Problems (CPAIOR’00), 2000.
Beck, J. C., P. Prosser, and E. Selensky, “On the reformulation of vehicle routing problems and scheduling problems,” in: LNAI 2371, Proceedings of the Symposium on Abstraction, Reformulation and Approximation (SARA 2002), 2002, pp. 282–289.
Beck, J. C., P. Prosser, and E. Selensky, “Vehicle routing and job shop scheduling: What’s the difference?” in: Proceedings of the 13th International Conference on Artificial Intelligence Planning and Scheduling, 2003.
Brind, C., C. Muller, and P. Prosser, “Stochastic techniques for resource management,” BT Technology Journal, 13, 55–65 (1995).
Cesta, A., A. Oddi, and S. F. Smith, “A constraint-based method for project scheduling with time windows,” Journal of Heuristics, 8(1), 109–136 (2000).
Clarke, G. and J. W. Wright, “Scheduling of vehicles from a central depot to a number of delivery points,” Operations Research, 12(4), 568–581 (1964).
Davenport, A. J. and J. C. Beck, “An investigation into two approaches for constraint directed resource allocation and scheduling,” In INFORMS, 1999.
DeBacker, B., V. Furnon, P. Shaw, P. Kilby, and P. Prosser, “Solving vehicle routing problems using constraint programming and metaheuritics,” Journal of Heuristics, 6, 5001–5523 (2000).
Focacci, F., P. Laborie, and W. Nuijten, “Solving scheduling problems with setup times and alternative resources,” in Proceedings of the 5th International Conference on Artificial Intelligence Planning and Scheduling, 2000.
Fox, M. S., Constraint-Directed Search: A Case Study of Job Shop Scheduling. PhD thesis, Carnegy Mellon University, Intelligent Systems Laboratory. The Robotics Institute, Pittsburgh, PA, 1983.
Garey, M. R. and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York, 1979.
Kilby, P., P. Prosser, and P. Shaw, “A comparison of traditional and constraint-based heuristics methods for vehicle routing problems with side constraints,” Constraints, 5(4), 389–414 (2000).
Laborie, P., “Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results,” in Proceedings of the 6th European Conference on Planning (ECP01), 2001.
Laborie, P., “Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results,” Artificial Intelligence, 143, 151–188 (2003).
Le Pape, C., “Implementation of resource constraints in ILOG SCHEDULE: A library for the development of constraint-based scheduling systems,” Intelligent Systems Engineering, 3(2), 55–66 (1994).
Nuijten, W. P. M., “Time and resource constrained scheduling: a constraint satisfaction approach,” PhD thesis, Department of Mathematics and Computing Science, Eindhoven University of Technology, 1994.
Prosser, P., P. Kilby, and P. Shaw, “Guided local search for the vehicle routing problem,” in Proceedings of the 2nd International Conference on Metaheuristics, 1997.
Puget, J. F., “Constraint programming next challenge: Simplicity of use,” in M. Wallace, (ed.), Proceedings of the Tenth International Conference on Principles and Practice of Constraint Programming (CP’04), 2004 pp. 5–8.
Smith, S. and C. Cheng, “Slack based heuristics for constraint satisfaction scheduling,” in Proceedings of the Eleventh National Conference on Artificial Intelligence (AAAI–93), 1993 pp. 139–144.
Solomon, M., “Algorithms for the vehicle routing and scheduling problem with time window constraints,” Operations Research, 35, 254–365 (1987).
Voudouris, C., and E. P. K. Tsang, “Guided local search,” European Journal of Operational Research, 113(2), 80–110 (1998).
Walsh, T., “Reformulating propositional satisfiability as constraint satisfaction,” in Symposium on Abstraction, Reformulation and Approximation (SARA), 2000.
PRAS vehicle routing and shop scheduling problem instances. http://www.dcs.gla.ac.uk/pras/resources/.
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was supported by EPSRC research grant GR/M90641, by Science Foundation Ireland under Grant 00/PI.1/C075, and by ILOG, SA.
Rights and permissions
About this article
Cite this article
Beck, J.C., Prosser, P. & Selensky, E. A case study of mutual routing-scheduling reformulation. J Sched 9, 469–491 (2006). https://doi.org/10.1007/s10951-006-8596-4
Issue Date:
DOI: https://doi.org/10.1007/s10951-006-8596-4