default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael Schneider 0004
Person information
- affiliation: RWTH Aachen University, Deutsche Post Chair of Optimization of Distribution Networks, Germany
- affiliation (former): TU Darmstadt, Department of Law and Economics
- not to be confused with: Michael Schneider 0002
Other persons with the same name
- Michael Schneider — disambiguation page
- Michael Schneider 0001 — FZI Research Center for Information Technology, Karlsruhe, Germany
- Michael Schneider 0002 — TU Darmstadt, Department of Computer Science
- Michael Schneider 0003 — German Research Center for Artificial Intelligence (DFKI), Saarbrücken
- Michael Schneider 0005 — University of Trier, Germany
- Michael Schneider 0006 — Macalester College, Saint Paul, MN, USA
- Michael Schneider 0007 — University of Hanover, Institute of Production Systems and Logistics (IFA), Germany
- Michael Schneider 0008
![[0000-0001-9846-7132]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0001-9846-7132")
— TU Wien, Institute of Sensor and Actuator Systems, Vienna, Austria - Michael Schneider 0009 — University of Kaiserslautern, Computer Science Department, Germany
- Michael Schneider 0010 — Technical University Munich, Germany
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j39]Mengdie Ye, Enrico Bartolini, Michael Schneider:
A general variable neighborhood search for the traveling salesman problem with time windows under various objectives. Discret. Appl. Math. 346: 95-114 (2024)- [j38]Rossana Cavagnini, Michael Schneider, Alina Theiß:
A granular iterated local search for the asymmetric single truck and trailer routing problem with satellite depots at DHL Group. Networks 83(1): 3-29 (2024) - [j37]Rossana Cavagnini, Michael Schneider, Alina Theiß:
A tabu search with geometry-based sparsification methods for angular traveling salesman problems. Networks 83(1): 30-52 (2024) - 2023
- [j36]Christian Becker, Jean Bertrand Gauthier, Timo Gschwind, Michael Schneider:
In-depth analysis of granular local search for capacitated vehicle routing. Discret. Appl. Math. 329: 61-86 (2023) - [j35]Maximilian Löffler, Enrico Bartolini, Michael Schneider:
A conceptually simple algorithm for the capacitated location-routing problem. EURO J. Comput. Optim. 11: 100063 (2023) - [j34]Alberto Santini, Michael Schneider, Thibaut Vidal, Daniele Vigo:
Decomposition Strategies for Vehicle Routing Heuristics. INFORMS J. Comput. 35(3): 543-559 (2023) - [j33]Maximilian Löffler, Michael Schneider, Ivan Zulj:
Cost-neutral reduction of infection risk in picker-to-parts warehousing systems. OR Spectr. 45(1): 151-179 (2023) - [j32]Maximilian Löffler, Nils Boysen, Michael Schneider:
Human-Robot Cooperation: Coordinating Autonomous Mobile Robots and Human Order Pickers. Transp. Sci. 57(4): 979-998 (2023) - 2022
- [j31]Ivan Zulj, Hagen Salewski, Dominik Goeke, Michael Schneider:
Order batching and batch sequencing in an AMR-assisted picker-to-parts system. Eur. J. Oper. Res. 298(1): 182-201 (2022) - [j30]Maximilian Löffler, Nils Boysen, Michael Schneider:
Picker Routing in AGV-Assisted Order Picking Systems. INFORMS J. Comput. 34(1): 440-462 (2022) - [j29]Hendrik Schaap, Maximilian Schiffer, Michael Schneider, Grit Walther:
A Large Neighborhood Search for the Vehicle Routing Problem with Multiple Time Windows. Transp. Sci. 56(5): 1369-1392 (2022) - 2021
- [j28]Alberto Santini, Enrico Bartolini, Michael Schneider, Vinicius Greco de Lemos:
The crop growth planning problem in vertical farming. Eur. J. Oper. Res. 294(1): 377-390 (2021) - [j27]Dominik Goeke, Michael Schneider:
Modeling Single-Picker Routing Problems in Classical and Modern Warehouses. INFORMS J. Comput. 33(2): 436-451 (2021) - [j26]Amir Foroughi, Nils Boysen, Simon Emde, Michael Schneider:
High-density storage with mobile racks: Picker routing and product location. J. Oper. Res. Soc. 72(3): 535-553 (2021) - [j25]Enrico Bartolini, Dominik Goeke, Michael Schneider, Mengdie Ye:
The Robust Traveling Salesman Problem with Time Windows Under Knapsack-Constrained Travel Time Uncertainty. Transp. Sci. 55(2): 371-394 (2021) - 2020
- [j24]Enrico Bartolini, Michael Schneider:
A two-commodity flow formulation for the capacitated truck-and-trailer routing problem. Discret. Appl. Math. 275: 3-18 (2020) - [j23]Maximilian Löffler, Guy Desaulniers, Stefan Irnich, Michael Schneider:
Routing electric vehicles with a single recharge per route. Networks 76(2): 187-205 (2020)
2010 – 2019
- 2019
- [j22]Dominik Goeke, Timo Gschwind, Michael Schneider:
Upper and lower bounds for the vehicle-routing problem with private fleet and common carrier. Discret. Appl. Math. 264: 43-61 (2019) - [j21]Michael Schneider, Timo Gschwind, Daniele Vigo:
Advances in vehicle routing and logistics optimization: exact methods. EURO J. Transp. Logist. 8(2): 117-118 (2019) - [j20]Felix Weidinger, Nils Boysen, Michael Schneider:
Picker routing in the mixed-shelves warehouses of e-commerce retailers. Eur. J. Oper. Res. 274(2): 501-515 (2019) - [j19]Julian Hof, Michael Schneider:
An adaptive large neighborhood search with path relinking for a class of vehicle-routing problems with simultaneous pickup and delivery. Networks 74(3): 207-250 (2019) - [j18]Michael Schneider, Maximilian Löffler:
Large Composite Neighborhoods for the Capacitated Location-Routing Problem. Transp. Sci. 53(1): 301-318 (2019) - [j17]Maximilian Schiffer, Michael Schneider, Grit Walther, Gilbert Laporte:
Vehicle Routing and Location Routing with Intermediate Stops: A Review. Transp. Sci. 53(2): 319-343 (2019) - [j16]Dominik Goeke, Roberto Roberti, Michael Schneider:
Exact and Heuristic Solution of the Consistent Vehicle-Routing Problem. Transp. Sci. 53(4): 1023-1042 (2019) - [i1]Dominik Goeke, Michael Schneider:
Modeling Single Picker Routing Problems in Classical and Modern Warehouses. CoRR abs/1909.13344 (2019) - 2018
- [j15]Ivan Zulj, Christoph H. Glock, Eric H. Grosse, Michael Schneider:
Picker routing and storage-assignment strategies for precedence-constrained order picking. Comput. Ind. Eng. 123: 338-347 (2018) - [j14]Ivan Zulj, Sergej Kramer, Michael Schneider:
A hybrid of adaptive large neighborhood search and tabu search for the order-batching problem. Eur. J. Oper. Res. 264(2): 653-664 (2018) - [j13]Maximilian Schiffer, Michael Schneider, Gilbert Laporte:
Designing sustainable mid-haul logistics networks with intra-route multi-resource facilities. Eur. J. Oper. Res. 265(2): 517-532 (2018) - 2017
- [j12]Michael Schneider, Michael Drexl:
A survey of the standard location-routing problem. Ann. Oper. Res. 259(1-2): 389-414 (2017) - [j11]Hamid Abedinnia, Christoph H. Glock, Eric H. Grosse, Michael Schneider:
Machine scheduling problems in production: A tertiary study. Comput. Ind. Eng. 111: 403-416 (2017) - [j10]Michael Schneider, Fabian Schwahn, Daniele Vigo:
Designing granular solution methods for routing problems with time windows. Eur. J. Oper. Res. 263(2): 493-509 (2017) - 2016
- [j9]Michael Schneider:
The vehicle-routing problem with time windows and driver-specific times. Eur. J. Oper. Res. 250(1): 101-119 (2016) - [j8]Guy Desaulniers, Fausto Errico, Stefan Irnich, Michael Schneider:
Exact Algorithms for Electric Vehicle-Routing Problems with Time Windows. Oper. Res. 64(6): 1388-1405 (2016) - 2015
- [j7]Michael Drexl, Michael Schneider:
A survey of variants and extensions of the location-routing problem. Eur. J. Oper. Res. 241(2): 283-308 (2015) - [j6]Dominik Goeke, Michael Schneider:
Routing a mixed fleet of electric and conventional vehicles. Eur. J. Oper. Res. 245(1): 81-99 (2015) - [j5]Michael Schneider, Andreas Stenger, Julian Hof:
An adaptive VNS algorithm for vehicle routing problems with intermediate stops. OR Spectr. 37(2): 353-387 (2015) - [j4]Michael Schneider, Andreas Stenger, Fabian Schwahn, Daniele Vigo:
Territory-Based Vehicle Routing in the Presence of Time-Window Constraints. Transp. Sci. 49(4): 732-751 (2015) - 2014
- [j3]Michael Schneider, Andreas Stenger, Dominik Goeke:
The Electric Vehicle-Routing Problem with Time Windows and Recharging Stations. Transp. Sci. 48(4): 500-520 (2014) - [p1]Stefan Irnich, Michael Schneider, Daniele Vigo:
Four Variants of the Vehicle Routing Problem. Vehicle Routing 2014: 241-271 - 2013
- [j2]Michael Schneider, Bastian Sand, Andreas Stenger:
A note on the time travel approach for handling time windows in vehicle routing problems. Comput. Oper. Res. 40(10): 2564-2568 (2013) - [j1]Andreas Stenger, Michael Schneider, Dominik Goeke:
The prize-collecting vehicle routing problem with single and multiple depots and non-linear cost. EURO J. Transp. Logist. 2(1-2): 57-87 (2013) - 2011
- [c7]Andreas Stenger, Michael Schneider, Oliver Wendt:
Towards an IT-based Planning Process Alignment: Integrated Route and Location Planning for Small Package Shippers. AMCIS 2011 - 2010
- [c6]Michael Schneider, Christian Doppstadt, Andreas Stenger, Michael Schwind:
Ant Colony Optimization for a stochastic vehicle routing problem with driver learning. IEEE Congress on Evolutionary Computation 2010: 1-8 - [c5]Michael Schwind, Andreas Schenk, Michael Schneider:
A Tool for the Analysis of Social Networks in Collaborative Software Development. HICSS 2010: 1-10 - [c4]Andreas Stenger, Michael Schneider, Michael Schwind:
Decision Support for Location Routing with Relocation Aspects. MKWI 2010: 1949-1959 - [c3]Christian Doppstadt, Michael Schneider, Andreas Stenger, Bastian Sand, Daniele Vigo, Michael Schwind:
Graph Sparsification for the Vehicle Routing Problem with Time Windows. OR 2010: 227-232
2000 – 2009
- 2007
- [c2]Michael Schneider, Markus Aleksy, Martin Schader, Makoto Takizawa:
Leasing Variants in Distributed Systems. CISIS 2007: 68-73 - 2005
- [c1]Michael Schneider, Markus Aleksy, Axel Korthaus, Martin Schader:
A Critical Review of the Resource Access Decision Specification in CORBA. PDPTA 2005: 940-945
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-28 21:15 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
