An Exact Framework for Solving the Space-Time Dependent TSP
Published Online:2 Apr 2026https://doi.org/10.1287/ijoc.2024.0866
References
- (2012) Dynamic-size multiple populations genetic algorithm for multigravity-assist trajectory optimization. J. Guidance Control Dynamics 35(2):520–529.Crossref, Google Scholar
- (2015) Integrated maritime fleet deployment and speed optimization: Case study from RoRo shipping. Comput. Oper. Res. 55:233–240.Crossref, Google Scholar
- (2016) Decision Diagrams for Optimization (Springer, Berlin).Crossref, Google Scholar
- (2014) Parallel combinatorial optimization with decision diagrams. Simonis H, eds. Proc. Internat. Conf. AI Techniques Constraint Programming Combinatorial Optim. Problems (Springer, Cham, Switzerland), 351–367.Google Scholar
- (2010) Automated multigravity assist trajectory planning with a modified ant colony algorithm. J. Aerospace Comput. Inform. Comm. 7(9):261–293.Crossref, Google Scholar
- (2023) Fourier transform-based surrogates for permutation problems. Silva S, Paquete L, eds. Gecco (ACM, New York), 275–283.Google Scholar
- (2013) Multivalued decision diagrams for sequencing problems. Oper. Res. 61(6):1259–1462.Link, Google Scholar
- (2024) Decision diagram-based branch-and-bound with caching for dominance and suboptimality detection. INFORMS J. Comput. 36(6):1522–1542.Link, Google Scholar
- (2016) Vehicle routing to minimize time-dependent emissions in urban areas. Eur. J. Oper. Res. 251(2):478–494.Crossref, Google Scholar
- (2015) Time-dependent routing problems: A review. Comput. Oper. Res. 64:189–197.Crossref, Google Scholar
- (2022) Discrete optimization with decision diagrams: Design of a generic solver, improved bounding techniques, and discovery of good feasible solutions with large neighborhood search. PhD thesis, Université Catholique de Louvain, Belgium.Google Scholar
- (2021) Improving the filtering of branch-and-bound MDD solver. Stuckey PJ, ed. Cpaior (Springer, Berlin), 231–247.Crossref, Google Scholar
- (2015) Interplanetary trajectory planning with Monte Carlo tree search. Yang Q, Wooldridge M, eds. Proc. IJCAI-15 (IJCAI/AAAI Press, Menlo Park, CA), 769–775.Google Scholar
- (2016) Fast approximators for optimal low-thrust hops between main belt asteroids. Chen X, Stafylopatis A, eds. Proc. IEEE Sympos. Series Comput. (IEEE, Piscataway, NJ), 1–7.Google Scholar
- (2021) Unbalanced mallows models for optimizing expensive black box permutation problems. Chicano F, Krawiec K, eds. Gecco (ACM, New York), 225–233.Google Scholar
- (2015) Revisiting Lambert’s problem. Celestial Mechanics Dynamical Astronomy 121:1–15.Crossref, Google Scholar
- (2015) Evolving solutions to TSP variants for active space debris removal. Silva S, Esparcia-Alcázar AI, eds. Gecco (ACM, New York), 1207–1214.Google Scholar
- (2013) Search for a grand tour of the Jupiter Galilean moons. Blum C, Alba E, eds. Gecco (ACM, New York), 1301–1308.Google Scholar
- (1988) A software package for sequential quadratic programming. Technical Report No. DFVLR-FB 88-28, DLR German Aerospace Center, Institute for Flight Mechanics, Koln, Germany.Google Scholar
- (2007) A combinatorial optimal control problem for spacecraft formation reconfiguration. Proc. 46th IEEE Conf. Decision Control (IEEE, Piscataway, NJ).Google Scholar
- (2022) The asteroid routing problem: A benchmark for expensive black box permutation optimization. Jiménez Laredo JL, eds. EvoApplications (Springer, Berlin), 124–140.Google Scholar
- (1988) Filtered beam search in scheduling. Internat. J. Production Res. 26(1):297–307.Crossref, Google Scholar
- (2018) Parallel algorithms for operations on multi-valued decision diagrams. McIlraith SA, Weinberger KQ, eds. Proc. AAAI Conf. Artificial Intelligence (AAAI Press, Palo Alto, CA).Crossref, Google Scholar
- (2014) GTOC5: Results from jet propulsion lab. Acta Futura 8:21–27.Google Scholar
- (2024) Peel and bound: Solving discrete optimization problems with decision diagrams and separation. PhD thesis, Polytechnique Montréal, Montreal, CA.Google Scholar
- (2022) Peel-and-bound: Generating stronger relaxed bounds with multivalued decision diagrams. Solnon C, eds. Proc. Internat. Conf. Principles Practice Constraint Programming, vol. 35 (Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Wadern, Germany), 1–20.Google Scholar
- (2023) Improved peel-and-bound: Methods for generating dual bounds with multivalued decision diagrams. J. Artificial Intelligence Res. 77:1489–1538.Crossref, Google Scholar
- (2024) An exact framework for solving the space-time dependent TSP. https://github.com/INFORMSJoC/2024.0866, https://doi.org/10.1287/ijoc.2024.0866.Google Scholar
- (2022) A fast randomized local search for low budget optimization in black box permutation problems. Proc. World Congress Comput. (IEEE, Piscataway, NJ).Google Scholar
- (2018) Spacecraft trajectory optimization: A review of models, objectives, approaches and solutions. Progress Aerospace Sci. 102:76–98.Crossref, Google Scholar
- (2017) Multi-rendezvous spacecraft trajectory optimization with Beam P-ACO. Hu B, López-Ibáñez M, eds. EvoCOP (Springer, Berlin), 141–156.Crossref, Google Scholar
- (2006) Preliminary design of multiple gravity-assist trajectories. J. Spacecraft Rockets 43(4):794–805.Crossref, Google Scholar
- (2014) Efficient global optimization for combinatorial problems. Igel C, Arnold DV, eds. Gecco (ACM, New York), 871–878.Google Scholar

