Abstract
When a major road traffic intersection is blocked, vehicles should be diverted from the incoming roads in such a way as to avoid the roads on the diversions from also becoming over-congested. Assuming different diversions may use partly the same roads, the challenge is to satisfy the following traffic flow constraint: ensure that even in the worst case scenario, the diversions can accommodate the same volume of traffic as the blocked intersection.
The number of diversions increases quadratically with the number of roads at the intersection. Moreover any road may be used by any subset of the diversions – thus the number of worst cases can grow exponentially with the number of diversions.
This paper investigates two different approaches to the problem, describes their implementation on the hybrid MIP/CP software platform ECLiPSe, and presents benchmark results on a set of test cases.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. John Wiley & Sons, New York (1988)
Jain, V., Grossmann, I.E.: Algorithms for Hybrid MILP/CP Models for a Class of Optimisation Problems. INFORMS Journal on Computing 13, 258–276 (2001)
Thorsteinsson, E.S.: Branch-and-Check: A Hybrid Framework Integrating Mixed Integer Programming and Constraint Logic Programming. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 16–30. Springer, Heidelberg (2001)
Benders, J.F.: Partitioning Procedures for Solving Mixed-Variables Programming Problems. Numerische Mathematik 4, 238–252 (1962)
Hooker, J.N., Ottosson, G.: Logic-Based Benders Decomposition. Mathematical Programming 96, 33–60 (2003)
Cheadle, A.M., Harvey, W., Sadler, A., Schimpf, J., Shen, K., Wallace, M.: ECLiPSe. Technical Report 03-1, IC-Parc, Imperial College London (2003)
ILOG: ILOG CPLEX 6.5 User’s Manual (1999), http://www.cplex.com
Dash Optimization: Dash Optimization Xpress–MP 14.21 User’s Manual (2003), http://www.dashoptimization.com
Eremin, A., Wallace, M.: Hybrid Benders Decomposition Algorithms in Constraint Logic Programming. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 1–15. Springer, Heidelberg (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Xia, Q., Eremin, A., Wallace, M. (2004). Problem Decomposition for Traffic Diversions. In: Régin, JC., Rueher, M. (eds) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. CPAIOR 2004. Lecture Notes in Computer Science, vol 3011. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24664-0_24
Download citation
DOI: https://doi.org/10.1007/978-3-540-24664-0_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21836-4
Online ISBN: 978-3-540-24664-0
eBook Packages: Springer Book Archive