Open Access
Issue
MATEC Web Conf.
Volume 312, 2020
9th International Conference on Engineering, Project, and Production Management (EPPM2018)
Article Number 02005
Number of page(s) 10
Section Theories and Applications of Project Management
DOI https://doi.org/10.1051/matecconf/202031202005
Published online 03 April 2020
  1. J. Nossack, E. Pesch, A truck scheduling problem arising in intermodal container transportation, European Journal of Operational Research 230: 666-680 (2013a) [CrossRef] [Google Scholar]
  2. J. Nossack, E. Pesch, Planning and scheduling in intermodal transport, Manufacturing Modelling, Management and Control 2013 in The Proceedings of the IFAC International Conference, St Petersburg, Russia (2013) (2013b) [Google Scholar]
  3. K.A. Kuzmicz, E. Pesch, Approaches to empty container repositioning problems in the context of Eurasian intermodal transportation, Omega - The Int. Journal of Management Science, in press. (2018) [Google Scholar]
  4. 40ton.net, https://40ton.net/dwa-ciezkie-kontenery-20-stopowe-w-ramach-az-74-tonowego-zestawu-jak-najbardziej-moga-miec-sens [Google Scholar]
  5. S. Erdoğan, E. Miller-Hooks, A green vehicle routing problem, Transportation Research Part E: Logistics and Transportation Review 48: 100-114 (2012) [CrossRef] [Google Scholar]
  6. J.D. Adler, P.B. Mirchandani, The vehicle scheduling problem for fleets with alternative-fuel vehicles, Transportation Science 51: 441-456 (2016) [CrossRef] [Google Scholar]
  7. Ç. Koç, I. Karaoglan, The green vehicle routing problem: A heuristic based exact solution approach, Applied Soft Computing 39, 154-164 (2016) [CrossRef] [Google Scholar]
  8. D.O. Santos, E.C. Xavier, Taxi and Ride Sharing: A Dynamic Dial-a-Ride Problem with Money as an Incentive, Expert Systems with Applications 42: 6728-6737 (2015) 8 [CrossRef] [Google Scholar]
  9. Hunsaker, M.V.P. Savelsbergh, Efficient feasibility testing for dial-a-ride problems, Operations Research Letters 30: 169-173 (2012) [CrossRef] [Google Scholar]
  10. J.-F. Cordeau, G. Laporte. The dial-a ride problem: models and algorithms, Annals of Operations Research 153: 29-46 (2007) [CrossRef] [Google Scholar]
  11. S.N. Parragh, Introducing heterogeneous users and vehicles into models and algorithms for the dial-a-ride problem. Transportation Research Part C: Emerging Technologies 19: 912-930 (2011) [CrossRef] [Google Scholar]
  12. S.N. Parragh, J.F. Cordeau, K.F., Doerner, R.F., Hartl, Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints, OR Spectrum 34, 593-633 (2012) [CrossRef] [Google Scholar]
  13. K. Braekers. A. Caris, G.K. Janssens, Exact and meta-heuristic approach for a general heterogeneous dial-a-ride problem with multiple depots, Transportation Research Part B: Methodological 67: 166-186 (2014) [CrossRef] [Google Scholar]
  14. M.A. Masmoudi, K. Braekers, M. Masmoudi, A. Dammak, A hybrid genetic algorithm for the heterogeneous dial-a-ride problem, Computers & Operations Research 81: 1-13 (2017) [CrossRef] [Google Scholar]
  15. M.A. Masmoudi, M. Hosny, K. Braekers, A. Dammak, Three effective metaheuristics to solve the multi-depot multi-trip heterogeneous dial-a-ride problem, Transportation Research Part E: Logistics and Transportation Review 96: 60-80 (2016) [CrossRef] [Google Scholar]
  16. K. Braekers, A. Kovacs, A multi-period dial-a-ride problem with driver consistency. A multi-period dial-a-ride problem with driver consistency, Transportation Research Part B: Methodological 94: 355-377 (2016) [CrossRef] [Google Scholar]
  17. Y. Molenbruch, K. Braekers, A. Caris, Typology and literature review for dial-a-ride problems, Annals of Operations Research 259: 295-325 (2017) [CrossRef] [Google Scholar]
  18. T. Bektas, G. Laporte, The pollution-routing problem. Transportation Research Part B: Methodological 45: 1232-1250 (2011) [CrossRef] [Google Scholar]
  19. E. Demir, T. Bektas, G. Laporte, An adaptive large neighborhood search heuristic for the pollution-routing problem, European Journal of Operational Research 223: 346–359 (2012) [CrossRef] [Google Scholar]
  20. E. Demir, T. Bektas, G. Laporte, The bi-objective pollution-routing problem. European Journal of Operational Research, 232: 464-478 (2014a) [CrossRef] [Google Scholar]
  21. E. Demir, T. Bektas, G. Laporte, A review of recent research on green road freight transportation. European Journal of Operational Research 237: 775–793 (2014b) [CrossRef] [Google Scholar]
  22. A. Sanguinetti, K. Kurani, J. Davies, The many reasons your mileage may vary: Toward a unifying typology of eco-driving behaviours, Transportation Research Part D: Transport and Environment 52 (Part A), 73–84 (2017) [CrossRef] [Google Scholar]
  23. Á. Felipe, M.T. Ortuño, G. Righini, G. Tirado, A heuristic approach for the green vehicle routing problem with multiple technologies and partial recharges. Transportation Research Part E: Logistics and Transportation Review 71: 111-128 (2014) [CrossRef] [Google Scholar]
  24. C. Lin, K.L. Choy, G.T.S. Ho, S.H. Chung, H.Y. Lam, Survey of Green Vehicle Routing Problem: Past and future trends, Expert Systems with Applications 41: 1118–1138 (2014) [CrossRef] [Google Scholar]
  25. D. Goeke, M. Schneider, Routing a mixed fleet of electric and conventional vehicles, European Journal of Operational Research 245, 81-99 (2015) [CrossRef] [Google Scholar]
  26. A. Franceschetti, E. Demir, D. Honhon, T. Van Woensel, G. Laporte, M. Stobbe, A metaheuristic for the time-dependent pollution-routing problem, European Journal of Operational Research 259(3): 972-991 (2017) [CrossRef] [Google Scholar]
  27. K.N. Androutsopoulos, K.G. Zografos, An integrated modelling approach for the bicriterion vehicle routing and scheduling problem with environmental considerations, Transportation Research Part C: Emerging Technologies 82:180-209 (2017) [CrossRef] [Google Scholar]
  28. E. Demir, Y. Huang, S. Scholts, T. Van Woensel, A selected review on the negative externalities of the freight transportation: Modeling and pricing, Transportation Research Part E: Logistics and Transportation Review 77: 95-114 (2015) [CrossRef] [Google Scholar]
  29. J.-F. Cordeau, A branch-and-cut algorithm for the dial-a-ride problem. Operations Research 54: 573–586 (2016) [CrossRef] [Google Scholar]
  30. D. Kress, S. Meiswinkel, E. Pesch, Mechanism design for machine scheduling problems, OR Spectrum 40: 583–611 (2018a) [CrossRef] [Google Scholar]
  31. D. Kress, S. Meiswinkel E. Pesch, Incentive compatible mechanisms for machine scheduling problems with job agents, Discrete Applied Mathematics 242: 89-101 (2018b) [CrossRef] [Google Scholar]
  32. M.Y. Kovalyov, E. Pesch, A game mechanism for single machine sequencing with zero risk, Omega - The Int. Journal of Management Science 44, 104-110 (2014) [CrossRef] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.