Graph transformations for the vehicle routing and job shop scheduling problems

DOI10.1007/3-540-45832-8_7MaRDI QIDQ4438765zbMATH OpenFDO

Authors J. Christopher Beck, Patrick Prosser, Evgeny Selensky

Publication date 10 December 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2505/25050060.htm, https://eprints.gla.ac.uk/3639/1/graph_transformations.pdf

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Deterministic scheduling theory in operations research (90B35) Programming involving graphs or networks (90C35)

Recommendations

• On the reformulation of vehicle routing problems and scheduling problems
• Transformations of node-balanced routing problems
• scientific article; zbMATH DE number 1114465
• Exact solution of the generalized routing problem through graph transformations
• scientific article; zbMATH DE number 2203358

Cited in

(5)

• An efficient transformation of the generalized vehicle routing problem
• Competitive analysis for the on-line truck transportation problem
• A multi-objective evolutionary algorithm to exploit the similarities of resource allocation problems
• A case study of mutual routing-scheduling reformulation
• Combined vehicle routing and scheduling with temporal precedence and synchronization constraints

This page was built for publication: Graph transformations for the vehicle routing and job shop scheduling problems

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