乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,13]],"date-time":"2024-07-13T14:10:16Z","timestamp":1720879816916},"reference-count":50,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T00:00:00Z","timestamp":1719792000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T00:00:00Z","timestamp":1719792000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2024,4,6]],"date-time":"2024-04-06T00:00:00Z","timestamp":1712361600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["444657906"],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006238","name":"California DFG","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006238","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2024,7]]},"DOI":"10.1016\/j.cor.2024.106639","type":"journal-article","created":{"date-parts":[[2024,4,12]],"date-time":"2024-04-12T01:29:03Z","timestamp":1712885343000},"page":"106639","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Accelerating value function approximations for dynamic dial-a-ride problems via dimensionality reductions"],"prefix":"10.1016","volume":"167","author":[{"ORCID":"http:\/\/orcid.org\/0000-0001-7964-0366","authenticated-orcid":false,"given":"R.-Julius O.","family":"Heitmann","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0001-9176-0117","authenticated-orcid":false,"given":"Ninja","family":"Soeffker","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0001-9613-182X","authenticated-orcid":false,"given":"Frank","family":"Klawonn","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0003-2499-6570","authenticated-orcid":false,"given":"Marlin W.","family":"Ulmer","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0003-1943-838X","authenticated-orcid":false,"given":"Dirk C.","family":"Mattfeld","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.cor.2024.106639_b1","doi-asserted-by":"crossref","first-page":"532","DOI":"10.1016\/j.sbspro.2011.04.530","article-title":"Dynamic ride-sharing: A simulation study in metro Atlanta","volume":"17","author":"Agatz","year":"2011","journal-title":"Procedia-Soc. Behav. Sci."},{"issue":"1","key":"10.1016\/j.cor.2024.106639_b2","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1287\/trsc.2018.0840","article-title":"A state aggregation approach for stochastic multiperiod last-mile ride-sharing problems","volume":"53","author":"Agussurja","year":"2019","journal-title":"Transp. Sci."},{"issue":"3","key":"10.1016\/j.cor.2024.106639_b3","doi-asserted-by":"crossref","first-page":"1088","DOI":"10.1016\/j.ejor.2020.01.033","article-title":"Approximate dynamic programming for planning a ride-hailing system using autonomous fleets of electric vehicles","volume":"284","author":"Al-Kanj","year":"2020","journal-title":"European J. Oper. Res."},{"issue":"3","key":"10.1016\/j.cor.2024.106639_b4","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1073\/pnas.1611675114","article-title":"On-demand high-capacity ride-sharing via dynamic trip-vehicle assignment","volume":"114","author":"Alonso-Mora","year":"2017","journal-title":"Proc. Natl. Acad. Sci."},{"key":"10.1016\/j.cor.2024.106639_b5","first-page":"430","article-title":"State aggregation by growing neural gas for reinforcement learning in continuous state spaces","volume":"vol. 1","author":"Baumann","year":"2011"},{"key":"10.1016\/j.cor.2024.106639_b6","doi-asserted-by":"crossref","DOI":"10.1016\/j.trc.2021.103520","article-title":"A business class for autonomous mobility-on-demand: Modeling service quality contracts in dynamic ridesharing systems","volume":"136","author":"Beirigo","year":"2022","journal-title":"Transp. Res. C"},{"issue":"3","key":"10.1016\/j.cor.2024.106639_b7","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1287\/trsc.2021.1069","article-title":"A learning-based optimization approach for autonomous ridesharing platforms with service-level contracts and on-demand hiring of idle vehicles","volume":"56","author":"Beirigo","year":"2022","journal-title":"Transp. Sci."},{"issue":"6","key":"10.1016\/j.cor.2024.106639_b8","doi-asserted-by":"crossref","first-page":"977","DOI":"10.1287\/opre.1040.0124","article-title":"Scenario-based planning for partially dynamic vehicle routing with stochastic customers","volume":"52","author":"Bent","year":"2004","journal-title":"Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2024.106639_b9","first-page":"1","article-title":"Feature-based aggregation and deep reinforcement learning: A survey and some new implementations","volume":"6","author":"Bertsekas","year":"2018","journal-title":"IEEE\/CAA J. Autom. Sin."},{"key":"10.1016\/j.cor.2024.106639_b10","series-title":"Proceedings of the 1991 IEEE International Symposium on Intelligent Control","first-page":"180","article-title":"A neural network approach to adaptive state-space partitioning","author":"Bing","year":"1991"},{"key":"10.1016\/j.cor.2024.106639_b11","series-title":"2010 IEEE\/RSJ International Conference on Intelligent Robots and Systems","first-page":"3219","article-title":"Using dimensionality reduction to exploit constraints in reinforcement learning","author":"Bitzer","year":"2010"},{"key":"10.1016\/j.cor.2024.106639_b12","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1016\/j.trd.2017.04.016","article-title":"Time-dependent green vehicle routing problem with stochastic vehicle speeds: An approximate dynamic programming algorithm","volume":"54","author":"\u00c7imen","year":"2017","journal-title":"Transp. Res. D"},{"issue":"2","key":"10.1016\/j.cor.2024.106639_b13","first-page":"89","article-title":"The dial-a-ride problem (DARP): Variants, modeling issues and algorithms","volume":"1","author":"Cordeau","year":"2003","journal-title":"Q. J. Belgian French Italian Oper. Res. Soc."},{"issue":"1","key":"10.1016\/j.cor.2024.106639_b14","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/s10479-007-0170-8","article-title":"The dial-a-ride problem: Models and algorithms","volume":"153","author":"Cordeau","year":"2007","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/j.cor.2024.106639_b15","unstructured":"Curran, W., Brys, T., Aha, D., Taylor, M., Smart, W.D., 2016. Dimensionality reduced reinforcement learning for assistive robots. In: 2016 AAAI Fall Symposium Series."},{"key":"10.1016\/j.cor.2024.106639_b16","series-title":"Using PCA to efficiently represent state spaces","author":"Curran","year":"2015"},{"issue":"6","key":"10.1016\/j.cor.2024.106639_b17","doi-asserted-by":"crossref","first-page":"850","DOI":"10.1287\/opre.51.6.850.24925","article-title":"The linear programming approach to approximate dynamic programming","volume":"51","author":"De Farias","year":"2003","journal-title":"Oper. Res."},{"key":"10.1016\/j.cor.2024.106639_b18","series-title":"Smart sustainable mobility targeted scenario N16","author":"European Commission","year":"2018"},{"key":"10.1016\/j.cor.2024.106639_b19","series-title":"The future of urban mobility","author":"European Commission","year":"2021"},{"key":"10.1016\/j.cor.2024.106639_b20","series-title":"Automated Machine Learning","first-page":"3","article-title":"Hyperparameter optimization","author":"Feurer","year":"2019"},{"key":"10.1016\/j.cor.2024.106639_b21","series-title":"The future of urban mobility","author":"Forbes","year":"2020"},{"issue":"10","key":"10.1016\/j.cor.2024.106639_b22","doi-asserted-by":"crossref","first-page":"1435","DOI":"10.1016\/j.cor.2010.12.014","article-title":"Optimization of occupancy rate in dial-a-ride problems via linear fractional column generation","volume":"38","author":"Garaix","year":"2011","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2024.106639_b23","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/s12469-008-0006-1","article-title":"The integrated dial-a-ride problem","volume":"1","author":"H\u00e4ll","year":"2009","journal-title":"Public Transp."},{"key":"10.1016\/j.cor.2024.106639_b24","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/j.compchemeng.2016.05.007","article-title":"Process control using finite Markov chains with iterative clustering","volume":"93","author":"Ikonen","year":"2016","journal-title":"Comput. Chem. Eng."},{"key":"10.1016\/j.cor.2024.106639_b25","series-title":"2009 Fourth International on Conference on Bio-Inspired Computing","first-page":"1","article-title":"Partitioning the state space by critical states","author":"Jin","year":"2009"},{"issue":"4","key":"10.1016\/j.cor.2024.106639_b26","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1016\/j.trb.2008.08.002","article-title":"A nested decomposition approach for solving the paratransit vehicle scheduling problem","volume":"43","author":"Karabuk","year":"2009","journal-title":"Transp. Res. B"},{"issue":"1","key":"10.1016\/j.cor.2024.106639_b27","doi-asserted-by":"crossref","first-page":"342","DOI":"10.32614\/RJ-2018-039","article-title":"dimRed and coranking\u2014unifying dimensionality reduction in R","volume":"10","author":"Kraemer","year":"2018","journal-title":"R J."},{"issue":"3","key":"10.1016\/j.cor.2024.106639_b28","doi-asserted-by":"crossref","first-page":"775","DOI":"10.1287\/trsc.2021.1042","article-title":"Dynamic ride-hailing with electric vehicles","volume":"56","author":"Kullman","year":"2022","journal-title":"Transp. Sci."},{"key":"10.1016\/j.cor.2024.106639_b29","series-title":"Dimensionality Reduction: A Comparative Review","author":"van der Maaten","year":"2009"},{"key":"10.1016\/j.cor.2024.106639_b30","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/j.cor.2013.07.020","article-title":"The dial-a-ride problem with transfers","volume":"41","author":"Masson","year":"2014","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"10.1016\/j.cor.2024.106639_b31","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1287\/ijoc.1090.0345","article-title":"Approximate dynamic programming for ambulance redeployment","volume":"22","author":"Maxwell","year":"2010","journal-title":"INFORMS J. Comput."},{"key":"10.1016\/j.cor.2024.106639_b32","series-title":"Yellow taxi trip data","author":"NYCOpenData","year":"2018"},{"key":"10.1016\/j.cor.2024.106639_b33","series-title":"2017 IEEE\/RSJ International Conference on Intelligent Robots and Systems","first-page":"4634","article-title":"Goal-driven dimensionality reduction for reinforcement learning","author":"Parisi","year":"2017"},{"issue":"1","key":"10.1016\/j.cor.2024.106639_b34","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/s12469-016-0128-9","article-title":"The integrated dial-a-ride problem with timetabled fixed route service","volume":"9","author":"Posada","year":"2017","journal-title":"Public Transp."},{"key":"10.1016\/j.cor.2024.106639_b35","series-title":"Reinforcement Learning and Stochastic Optimization","author":"Powell","year":"2021"},{"key":"10.1016\/j.cor.2024.106639_b36","series-title":"2021 IEEE International Intelligent Transportation Systems Conference","first-page":"2447","article-title":"Reinforcement learning for ridesharing: A survey","author":"Qin","year":"2021"},{"key":"10.1016\/j.cor.2024.106639_b37","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.trc.2013.03.007","article-title":"The heterogeneous pickup and delivery problem with configurable vehicle capacity","volume":"32","author":"Qu","year":"2013","journal-title":"Transp. Res. C"},{"issue":"2","key":"10.1016\/j.cor.2024.106639_b38","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1287\/trsc.2014.0524","article-title":"A branch-and-price-and-cut algorithm for heterogeneous pickup and delivery problems with configurable vehicle capacity","volume":"49","author":"Qu","year":"2015","journal-title":"Transp. Sci."},{"issue":"1","key":"10.1016\/j.cor.2024.106639_b39","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1109\/TCNS.2020.3027780","article-title":"Fast online reinforcement learning control using state-space dimensionality reduction","volume":"8","author":"Sadamoto","year":"2020","journal-title":"IEEE Trans. Control Netw. Syst."},{"issue":"12","key":"10.1016\/j.cor.2024.106639_b40","doi-asserted-by":"crossref","first-page":"1719","DOI":"10.1016\/j.cor.2011.02.006","article-title":"Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports","volume":"38","author":"Schilde","year":"2011","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"10.1016\/j.cor.2024.106639_b41","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1016\/j.ejor.2011.10.043","article-title":"Solving the dynamic ambulance relocation and dispatching problem using approximate dynamic programming","volume":"219","author":"Schmid","year":"2012","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2024.106639_b42","first-page":"507","article-title":"Neural approximate dynamic programming for on-demand ride-pooling","volume":"vol. 34","author":"Shah","year":"2020"},{"key":"10.1016\/j.cor.2024.106639_b43","first-page":"229","article-title":"Problem-specific state space partitioning for dynamic vehicle routing problems","author":"Soeffker","year":"2016","journal-title":"Proc. MKWI"},{"issue":"3","key":"10.1016\/j.cor.2024.106639_b44","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/s12599-019-00582-7","article-title":"Adaptive state space partitioning for dynamic decision processes","volume":"61","author":"Soeffker","year":"2019","journal-title":"Bus. Inf. Syst. Eng."},{"key":"10.1016\/j.cor.2024.106639_b45","series-title":"Smart mobility report","author":"Statista","year":"2021"},{"key":"10.1016\/j.cor.2024.106639_b46","doi-asserted-by":"crossref","DOI":"10.1016\/j.ejtl.2020.100008","article-title":"On modeling stochastic dynamic vehicle routing problems","author":"Ulmer","year":"2020","journal-title":"EURO J. Transp. Logist."},{"issue":"1","key":"10.1016\/j.cor.2024.106639_b47","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1287\/trsc.2016.0719","article-title":"Budgeting time for dynamic vehicle routing with stochastic customer requests","volume":"52","author":"Ulmer","year":"2018","journal-title":"Transp. Sci."},{"issue":"1","key":"10.1016\/j.cor.2024.106639_b48","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/j.ejor.2019.04.029","article-title":"Meso-parametric value function approximation for dynamic customer acceptances in delivery routing","volume":"285","author":"Ulmer","year":"2020","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.cor.2024.106639_b49","series-title":"German Conference on Multiagent System Technologies","first-page":"165","article-title":"Smize: A spontaneous ride-sharing system for individual urban transit","author":"Xing","year":"2009"},{"issue":"9","key":"10.1016\/j.cor.2024.106639_b50","doi-asserted-by":"crossref","first-page":"3811","DOI":"10.1109\/TITS.2019.2934423","article-title":"An integrated decomposition and approximate dynamic programming approach for on-demand ride pooling","volume":"21","author":"Yu","year":"2019","journal-title":"IEEE Trans. Intell. Transp. Syst."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054824001114?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054824001114?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,7,13]],"date-time":"2024-07-13T13:04:50Z","timestamp":1720875890000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054824001114"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7]]},"references-count":50,"alternative-id":["S0305054824001114"],"URL":"https:\/\/doi.org\/10.1016\/j.cor.2024.106639","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2024,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Accelerating value function approximations for dynamic dial-a-ride problems via dimensionality reductions","name":"articletitle","label":"Article Title"},{"value":"Computers & Operations Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cor.2024.106639","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2024 The Author(s). Published by Elsevier Ltd.","name":"copyright","label":"Copyright"}],"article-number":"106639"}}