Michael Schneider
Orcid: 0000-0002-4203-8926Affiliations:
- RWTH Aachen University, Deutsche Post Chair of Optimization of Distribution Networks, Germany
- TU Darmstadt, Department of Law and Economics (former)
According to our database1,
Michael Schneider
authored at least 47 papers
between 2005 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
On csauthors.net:
Bibliography
2024
A tabu search with geometry-based sparsification methods for angular traveling salesman problems.
Networks, January, 2024
A granular iterated local search for the asymmetric single truck and trailer routing problem with satellite depots at DHL Group.
Networks, January, 2024
A general variable neighborhood search for the traveling salesman problem with time windows under various objectives.
Discret. Appl. Math., 2024
2023
Human-Robot Cooperation: Coordinating Autonomous Mobile Robots and Human Order Pickers.
Transp. Sci., July, 2023
Discret. Appl. Math., April, 2023
OR Spectr., March, 2023
EURO J. Comput. Optim., January, 2023
2022
A Large Neighborhood Search for the Vehicle Routing Problem with Multiple Time Windows.
Transp. Sci., 2022
Eur. J. Oper. Res., 2022
2021
The Robust Traveling Salesman Problem with Time Windows Under Knapsack-Constrained Travel Time Uncertainty.
Transp. Sci., 2021
J. Oper. Res. Soc., 2021
INFORMS J. Comput., 2021
2020
A two-commodity flow formulation for the capacitated truck-and-trailer routing problem.
Discret. Appl. Math., 2020
2019
Transp. Sci., 2019
Transp. Sci., 2019
Transp. Sci., 2019
An adaptive large neighborhood search with path relinking for a class of vehicle-routing problems with simultaneous pickup and delivery.
Networks, 2019
Eur. J. Oper. Res., 2019
EURO J. Transp. Logist., 2019
Upper and lower bounds for the vehicle-routing problem with private fleet and common carrier.
Discret. Appl. Math., 2019
2018
A hybrid of adaptive large neighborhood search and tabu search for the order-batching problem.
Eur. J. Oper. Res., 2018
Designing sustainable mid-haul logistics networks with intra-route multi-resource facilities.
Eur. J. Oper. Res., 2018
Picker routing and storage-assignment strategies for precedence-constrained order picking.
Comput. Ind. Eng., 2018
2017
Eur. J. Oper. Res., 2017
2016
Oper. Res., 2016
Eur. J. Oper. Res., 2016
2015
Transp. Sci., 2015
OR Spectr., 2015
Eur. J. Oper. Res., 2015
Eur. J. Oper. Res., 2015
2014
Transp. Sci., 2014
Proceedings of the Vehicle Routing, 2014
2013
The prize-collecting vehicle routing problem with single and multiple depots and non-linear cost.
EURO J. Transp. Logist., 2013
A note on the time travel approach for handling time windows in vehicle routing problems.
Comput. Oper. Res., 2013
2011
Towards an IT-based Planning Process Alignment: Integrated Route and Location Planning for Small Package Shippers.
Proceedings of the A Renaissance of Information Technology for Sustainability and Global Competitiveness. 17th Americas Conference on Information Systems, 2011
2010
Proceedings of the Operations Research Proceedings 2010, 2010
Proceedings of the Multikonferenz Wirtschaftsinformatik, 2010
Proceedings of the 43rd Hawaii International International Conference on Systems Science (HICSS-43 2010), 2010
Ant Colony Optimization for a stochastic vehicle routing problem with driver learning.
Proceedings of the IEEE Congress on Evolutionary Computation, 2010
2007
Proceedings of the First International Conference on Complex, 2007
2005
A Critical Review of the Resource Access Decision Specification in CORBA.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2005