Large neighbourhood search based on mixed integer programming and ant colony optimisation for car sequencing

References

• Bautista, J., J. Pereira, and B. Adenso-Díaz. 2008. “A Beam Search Approach for the Optimization Version of the Car Sequencing Problem.” Annals of Operations Research 159: 233–244. doi: 10.1007/s10479-007-0278-x
   Web of Science ®Google Scholar
• Bertsekas, D.. 1995. Nonlinear Programming. 2nd ed. New Hampshire: Athena Scientific.
   Google Scholar
• Blum, C.. 2005. “Beam-ACO: Hybridizing Ant Colony Optimization with Beam Search: An Application to Open Shop Scheduling.” Computers and Operations Research 32: 1565–1591. doi: 10.1016/j.cor.2003.11.018
   Web of Science ®Google Scholar
• Boschetti, M., and V. Maniezzo. 2009. “Benders Decomposition, Lagrangian Relaxation and Metaheuristic Design.” Journal of Heuristics 15: 283–312. doi: 10.1007/s10732-007-9064-9
   Web of Science ®Google Scholar
• Camazine, S., J.-L. Deneubourg, N. R. Franks, J. Sneyd, G. Theraulaz, and E. Bonabeau. 2001. Self-Organization in Biological Systems. Princeton, NJ: Princeton University Press.
   Google Scholar
• Chutima, Parames, and Sathaporn Olarnviwatchai. 2018. “A Multi-objective Car Sequencing Problem on Two-sided Assembly Lines.” Journal of Intelligent Manufacturing 29 (7): 1617–1636. doi: 10.1007/s10845-016-1201-6
   Web of Science ®Google Scholar
• Cordeau, J.-F., G. Laporte, and F. Pasin. 2008. “Iterated Tabu Search for the Car Sequencing Problem.” European Journal of Operational Research 191 (3): 945–956. doi: 10.1016/j.ejor.2007.04.048
   Web of Science ®Google Scholar
• Dincbas, M., H. Simonis, and P. Van Hentenryck. 1988. “Solving the Car-sequencing Problem in Constraint Logic Programming.” In 8th European Conference on Artificial Intelligence – ECAI 88, London, UK, 290–295. Pitmann Publishing.
   Google Scholar
• Dorigo, M.. 1992. “Optimization, Learning and Natural Algorithms.” PhD thesis, Dip. Elettronica.
   Google Scholar
• Dorigo, M., and T. Stützle. 2004. Ant Colony Optimization. Cambridge, MA: MIT Press.
   Google Scholar
• eSolutions Service Desk. 2017. The Monash Campus Cluster – Confluence, Monash University.
   Google Scholar
• Gent, I.. 1998. Two Results on Car Sequencing Problems. Technical Report APES02. St. Andrews: University of St. Andrews.
   Google Scholar
• Gottlieb, J., M. Puchta, and C. Solnon. 2003. “A Study of Greedy, Local Search and ACO for Car Sequencing Problems.” Lecture Notes in Computer Science 2611: 245–282.
   Google Scholar
• Gravel, M., C. Gagné, and W. Price. 2004. “Review and Comparison of Three Methods for the Solution of the Car-sequencing Problem.” Journal of the Operational Research Society 56: 1287–1295. doi: 10.1057/palgrave.jors.2601955
   Web of Science ®Google Scholar
• Gurobi Optimization. 2015. Gurobi Optimizer Reference Manual.
   Google Scholar
• Jahren, Eivind, and Roberto Achá Asın. 2018. “A Column Generation Approach and New Bounds for the Car Sequencing Problem.” Annals of Operations Research 264 (1): 193–211. doi: 10.1007/s10479-017-2663-4
   Web of Science ®Google Scholar
• Khichane, M., P. Albert, and C. Solnon. 2008. “CP with ACO.” Lecture Notes in Computer Science 5015: 328–332. doi: 10.1007/978-3-540-68155-7_32
   Google Scholar
• Kis, T.. 2004. “On the Complexity of the Car Sequencing Problem.” Operations Research Letters 32 (4): 331–335. doi: 10.1016/j.orl.2003.09.003
   Web of Science ®Google Scholar
• Parrello, B., W. Kebat, and L. Wos. 1986. “Job-Shop Scheduling Using Automated Reasoning: A Case Study of the Car Sequencing Problem.” Journal of Automated Reasoning 2: 1–42. doi: 10.1007/BF00246021
   Google Scholar
• Perron, L., and P. Shaw. 2004. “Combining Forces to Solve the Car Sequencing Problem.” In CPAIOR-04, Vol. 3011, 225–239. Springer-Verlag.
   Google Scholar
• Prandtstetter, M., and G. R. Raidl. 2008. “An Integer Linear Programming Approach and a Hybrid Variable Neighborhood Search for the Car Sequencing Problem.” European Journal of Operational Research 191 (3): 1004–1022. doi: 10.1016/j.ejor.2007.04.044
   Web of Science ®Google Scholar
• Ribeiro, C. C., D. Aloise, T. F. Noronha, C. Rocha, and S. Urrutia. 2008. “An Efficient Implementation of a VNS/ILS Heuristic for a Real-life Car Sequencing Problem.” European Journal of Operational Research 191 (3): 596–611. doi: 10.1016/j.ejor.2007.02.003
   Web of Science ®Google Scholar
• Salmela, L., V. Mäkinen, N. Välimäki, J. Ylinen, and E. Ukkonen. 2011. “Fast Scaffolding with Small Independent Mixed Integer Programs.” Bioinformatics (Oxford, England) 27 (23): 3259–3265. doi: 10.1093/bioinformatics/btr562
   PubMed Web of Science ®Google Scholar
• Sun, Hui, and Shujin Fan. 2018. “Car Sequencing for Mixed-model Assembly Lines with Consideration of Changeover Complexity.” Journal of Manufacturing Systems 46: 93–102. doi: 10.1016/j.jmsy.2017.11.009
   Web of Science ®Google Scholar
• Thiruvady, D. R., A. T. Ernst, and M. Wallace. 2014. “A Lagrangian-ACO Matheuristic for Car Sequencing.” EURO Journal on Computational Optimization 2 (4): 279–296. doi: 10.1007/s13675-014-0023-6
   Google Scholar
• Thiruvady, D., B. Meyer, and A. T. Ernst. 2011. “Car Sequencing with Constraint-based ACO.” In Proceedings of the 13th Annual Conference on Genetic and Evolutionary Computation, GECCO '11, New York, USA, 163–170. ACM.
   Google Scholar
• Valente, J. M. S., and R. A. F. S. Alves. 2008. “Beam Search Algorithms for the Single Machine Total Weighted Tardiness Scheduling Problem with Sequence-Dependent Setups.” Computers and Operations Research 35 (7): 2388–2405. doi: 10.1016/j.cor.2006.11.004
   Web of Science ®Google Scholar
• Van Hentenryck, P., H. Simonis, and M. Dincbas. 1992. “Constraint Satisfaction Using Constraint Logic Programming.” Artificial Intelligence 58: 113–159. doi: 10.1016/0004-3702(92)90006-J
   Web of Science ®Google Scholar
• Xiangwei, M., Z. Ping, and L. Chunjin. 2011. “Sliding Window Algorithm for Aircraft Landing Problem.” In 2011 Chinese Control and Decision Conference (CCDC), 874–879.
   Google Scholar
• Zhang, X., L. Gao, L. Wen, and Z. Huang. 2017. “Parallel Construction Heuristic Combined with Constraint Propagation for the Car Sequencing Problem.” Chinese Journal of Mechanical Engineering 30 (2): 373–384. doi: 10.1007/s10033-017-0083-7
   Web of Science ®Google Scholar