Visiting a network of services with time constraints.

DOI10.1016/S0305-0548(02)00067-9MaRDI QIDQ1413815zbMATH OpenFDO

Authors Monica Gentili

Publication date 17 November 2003

Published in Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

RoutingSchedulingShortest pathTime windows

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Trip planning for visitors in a service system with capacity constraints
• scientific article; zbMATH DE number 1002205
• Service-constrained network design problems
• Temporal network optimization subject to connectivity constraints
• Temporal network optimization subject to connectivity constraints
• Methods for routing with time windows
• Time analysis for planning a path in a time-window network
• Time-varying network optimization.

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows
• Routing problems: A bibliography
• Vehicle Routing with Time Windows

Cited in

(3)

• Delivery itineraries and distribution capacity of a freight network with time slots
• Shortest path problems with left-side time windows
• Multiperiod integrated routing and scheduling of World Food Programme cargo planes in Angola

This page was built for publication: Visiting a network of services with time constraints.

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