The Non-Emergency Patient Transport Modelled as a Team Orienteering Problem

DOI10.1007/978-3-319-27680-9_10MaRDI QIDQ5281616zbMATH OpenOpenAlexWikidataFDO

Authors

Publication date 26 July 2017

Published in Operations Research and Enterprise Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-27680-9_10

zbMATH Keywords

mixed integer linear programmingteam orienteering problemnon-emergency patients transport

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Case-oriented studies in operations research (90B90) Mixed integer programming (90C11)

Recommendations

• On a model and optimization algorithms for a dynamic team orienteering problem
• A tabu search heuristic for the dynamic transportation of patients between care units
• A stochastic optimization model for real-time ambulance redeployment
• Recent optimization models and trends in location, relocation, and dispatching of emergency medical vehicles
• The EMS vehicle patient transportation problem during a demand surge
• The team orienteering pick-up and delivery problem with time windows and its applications in fleet sizing
• Ambulance location and relocation problems with time-dependent travel times

Cited in

(2)

• Minimizing the maximal ergonomic burden in intra-hospital patient transportation
• MILP models of a patient transportation problem

Describes a project that uses

Uses Software

• NEOS
• XPRESS
• MINTO
• Gurobi
• AMPL
• SCIP

This page was built for publication: The Non-Emergency Patient Transport Modelled as a Team Orienteering Problem

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