Time-dependent travelling salesman problem.

DOI10.1007/BF03398730MaRDI QIDQ2476429zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 19 March 2008

Published in Opsearch (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf03398730

zbMATH Keywords

alphabet-tablelexi-search algorithm, pattern recognition techniquepatterntime-dependent travelling salesman problemtourtrip-scheduleword

Mathematics Subject Classification ID

Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• Time‐dependent traveling salesman problem–the deliveryman case
• scientific article; zbMATH DE number 947471
• A pattern recognition lexi search approach to generalized time-dependent travelling salesman problem
• The traveling salesman problem with cumulative costs
• A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem

Cites work

• A method for solving traveling-salesman problems
• An Algorithm for the Traveling Salesman Problem
• An Integer Generalized Transportation Model for Optimal Job Assignment in Computer Networks
• Integer Programming Formulation of Traveling Salesman Problems
• Production scheduling by the transportation method of linear programming
• The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
• The Traveling Salesman Problem: A Survey
• The traveling-salesman problem

Cited in

(5)

• The time-dependent traveling salesman problem
• scientific article; zbMATH DE number 15374 (Why is no real title available?)
• Continuous time dependent multilple travelling salesman problem
• A pattern recognition lexi search approach to generalized time-dependent travelling salesman problem
• The traveling salesman problem with cumulative costs

This page was built for publication: Time-dependent travelling salesman problem.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2476429)