scientific article; zbMATH DE number 5016779

zbMATH1101.90014MaRDI QIDQ3378422FDOQ3378422

Authors Armin Fügenschuh

Publication date 31 March 2006

zbMATH Keywords

vehicle routinghit-and-rungreedy heuristicimproving hit-and-runpure random searchbranch and cut algorithmsnearest neighbour heuristictraveling Salesman problems

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Applications of mathematical programming (90C90) Combinatorial optimization (90C27) Mixed integer programming (90C11) Traffic problems in operations research (90B20)

Recommendations

• A multicriteria approach for optimizing bus schedules and school starting times
• Scheduling Buses and School Starting Times
• Integrated optimization in public transport planning
• A school bus scheduling problem
• School-bus routing for program scheduling
• School bus routing and scheduling problem
• Periodic Timetable Optimization in Public Transport
• scientific article; zbMATH DE number 1683913
• A survey of school timetabling research

Cited in

(7)

• scientific article; zbMATH DE number 1683927 (Why is no real title available?)
• Solving a school bus scheduling problem with integer programming
• Policy Analytics in Public School Operations
• The vehicle routing problem with coupled time windows
• A set partitioning reformulation of a school bus scheduling problem
• Scheduling Buses and School Starting Times
• A multicriteria approach for optimizing bus schedules and school starting times

This page was built for publication:

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