Optimal routing and process scheduling for a mobile service facility

DOI10.1002/NET.3230220204MaRDI QIDQ3356097zbMATH OpenOpenAlexFDO

Authors Umit Akinc, Kizhanatham Srikanth

Publication date 1992

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230220204

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Transportation, logistics and supply chain management (90B06) Queues and service in operations research (90B22) Integer programming (90C10) Applications of mathematical programming (90C90)

Cited in

(6)

• A review of extensive facility location in networks
• A branch-and-price algorithm for a vehicle routing with demand allocation problem
• A variable neighborhood search for the last-mile delivery problem during major infectious disease outbreak
• Spatial coverage in routing and path planning problems
• Metaheuristics and cooperative approaches for the bi-objective ring star problem
• An exact approach for the vehicle routing problem with demand allocation

This page was built for publication: Optimal routing and process scheduling for a mobile service facility

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