Learning to recognize (un)promising simulated annealing runs: Efficient search procedures for job shop scheduling and vehicle routing

DOI10.1023/A:1018907412789zbMath0895.90160OpenAlexW4255940282MaRDI QIDQ1379745

Sam R. Thangiah, Norman M. Sadeh, Yoichiro Nakakuki

Publication date: 20 September 1998

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1018907412789

zbMATH Keywords

simulated annealingvehicle routingtime windowsnear-optimal solutions

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

This page was built for publication: Learning to recognize (un)promising simulated annealing runs: Efficient search procedures for job shop scheduling and vehicle routing