{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,19]],"date-time":"2025-10-19T06:07:14Z","timestamp":1760854034547,"version":"3.37.3"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"14","license":[{"start":{"date-parts":[[2018,5,31]],"date-time":"2018-05-31T00:00:00Z","timestamp":1527724800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1007\/s00500-018-3258-y","type":"journal-article","created":{"date-parts":[[2018,5,31]],"date-time":"2018-05-31T15:42:37Z","timestamp":1527781357000},"page":"5945-5966","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Lower and upper bounds for scheduling multiple balancing vehicles in bicycle-sharing systems"],"prefix":"10.1007","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3549-9027","authenticated-orcid":false,"given":"Ahmed A.","family":"Kadri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6649-7257","authenticated-orcid":false,"given":"Imed","family":"Kacem","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Karim","family":"Labadi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,5,31]]},"reference":[{"issue":"3","key":"3258_CR1","doi-asserted-by":"publisher","first-page":"1077","DOI":"10.1287\/trsc.2015.0637","volume":"50","author":"R Anholt","year":"2016","unstructured":"Anholt R, Coelho L, Laporte G, Vis I (2016) An inventory-routing problem with pickups and deliveries arising in the replenishment of automated teller machines. Transp. Sci. 50(3):1077\u20131091","journal-title":"Transp. Sci."},{"key":"3258_CR2","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1016\/S0001-4575(99)00028-7","volume":"31","author":"L Aultman-Hall","year":"1999","unstructured":"Aultman-Hall L, Kaltenecker-Georgina M (1999) Toronto bicycle commuter safety rates. Accid Anal Prev 31:675\u2013686","journal-title":"Accid Anal Prev"},{"key":"3258_CR3","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1051\/ro\/2011102","volume":"45","author":"M Benchimol","year":"2010","unstructured":"Benchimol M, Benchimol P, Chappert B, Taille A, Laroche F, Meunier F, Robinet L (2010) Balancing the stations of a self-service bike hire system. RAIRO Oper. Res. 45:37\u201361","journal-title":"RAIRO Oper. Res."},{"key":"3258_CR4","doi-asserted-by":"publisher","first-page":"1308","DOI":"10.1016\/j.sbspro.2012.09.845","volume":"54","author":"M Bordagaray","year":"2012","unstructured":"Bordagaray M, Ibeas A, dellOlio L (2012) Modelling user perception of public bicycle services. EWGT 2012, 15th meeting of the EURO working group on transportation. Procedia Soc Behav Sci 54:1308\u20131316","journal-title":"Procedia Soc Behav Sci"},{"key":"3258_CR5","unstructured":"Call\u00e9 E (2009) Director of Operation in V\u00e9lib, April 2009, Personal communication"},{"issue":"7","key":"3258_CR6","doi-asserted-by":"publisher","first-page":"1341","DOI":"10.1007\/s11590-016-1072-y","volume":"11","author":"F Carrabs","year":"2017","unstructured":"Carrabs F, Cerulli R, D\u2019Ambrosio C, Raiconi A (2017a) An exact algorithm to extend lifetime through roles allocation in sensor networks with connectivity constraints. Optim Lett 11(7):1341\u20131356","journal-title":"Optim Lett"},{"issue":"9","key":"3258_CR7","doi-asserted-by":"publisher","first-page":"2439","DOI":"10.1007\/s00500-016-2406-5","volume":"21","author":"F Carrabs","year":"2017","unstructured":"Carrabs F, Cerulli R, Sciomachen A (2017b) An exact approach for the grocery delivery problem in urban areas. Soft Comput 21(9):2439\u20132450","journal-title":"Soft Comput"},{"key":"3258_CR8","doi-asserted-by":"publisher","DOI":"10.1002\/net.21682","author":"F Castao","year":"2016","unstructured":"Castao F (2016) Partial target coverage to extend the lifetime in wireless multi-role sensor networks. Networks. https:\/\/doi.org\/10.1002\/net.21682","journal-title":"Networks"},{"issue":"10","key":"3258_CR9","doi-asserted-by":"publisher","first-page":"6919","DOI":"10.1016\/j.eswa.2010.03.030","volume":"37","author":"Y Chang","year":"2010","unstructured":"Chang Y (2010) Adopting co-evolution and constraint-satisfaction concept on genetic algorithms to solve supply chain network design problems. Expert Syst Appl 37(10):6919\u20136930","journal-title":"Expert Syst Appl"},{"key":"3258_CR10","unstructured":"Chemla D, Meunier F, WolflerCalvo R (2011) Balancing a bike-sharing system with multiple vehicles. ROADEF, Saint-Etienne, France"},{"issue":"2","key":"3258_CR11","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/j.disopt.2012.11.005","volume":"10","author":"D Chemla","year":"2013","unstructured":"Chemla D, Meunier F, Wolfer-Calvo R (2013) Bike sharing systems: solving the static rebalancing problem. Discrete Optim 10(2):120\u2013146","journal-title":"Discrete Optim"},{"key":"3258_CR12","unstructured":"Christophe P, Hugues B (2007) A gestalt genetic algorithm: less details for better search. In: Genetic and evolutionary computation conference, pp 1328\u20131334"},{"issue":"4","key":"3258_CR13","doi-asserted-by":"publisher","first-page":"41","DOI":"10.5038\/2375-0901.12.4.3","volume":"14","author":"P DeMaio","year":"2009","unstructured":"DeMaio P (2009) Bike-sharing: history, impacts, models of provision, and future. J Public Transp 14(4):41\u201356","journal-title":"J Public Transp"},{"key":"3258_CR14","doi-asserted-by":"crossref","unstructured":"Di Gasperro L, Rendl A, Urli T (2013) A hybrid ACO+CP for balancing bicycle-sharing systems. In: Blesa MJ, Blum C, Festa P, Roli A, Sampels M (eds) HM 2013, vol 7919. LNCS, pp 198\u2013212","DOI":"10.1007\/978-3-642-38516-2_16"},{"key":"3258_CR15","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1287\/mnsc.11.2.268","volume":"11","author":"WL Eastman","year":"1964","unstructured":"Eastman WL, Evan S, Issacs IM (1964) Bounds for the optimal scheduling of N jobs on M processors. Manag Sci 11:268\u2013279","journal-title":"Manag Sci"},{"key":"3258_CR16","doi-asserted-by":"crossref","unstructured":"Fricker C, Gast N, Mohamed H (2012) Mean field analysis for inhomogeneous bike sharing systems. In: Proceedings of the twenty-third international meeting on probabilistic, combinatorial, and asymptotic methods for the analysis of algorithms. DMTCS, pp 365\u2013376","DOI":"10.46298\/dmtcs.3006"},{"key":"3258_CR17","first-page":"36","volume-title":"Genetic algorithm in search, optimization and machine learning","author":"D Goldberg","year":"1989","unstructured":"Goldberg D (1989) Genetic algorithm in search, optimization and machine learning. Addison Wesley, Boston, p 36"},{"key":"3258_CR18","doi-asserted-by":"publisher","unstructured":"Kacem I (2013) Genetic algorithms for solving flexible job shop scheduling problems. In: Metaheuristics for production scheduling. ISBN 9781118731598. https:\/\/doi.org\/10.1002\/9781118731598.ch2","DOI":"10.1002\/9781118731598.ch2"},{"key":"3258_CR19","unstructured":"Kadri AA, Labadi K, Kacem I (2013) An integrated stochastic petri net and GA for dynamic rebalancing in public bicycle-sharing systems. In: 43rd international conference on computer and industrial engineering (CIE43), October 16\u201318, 2013, vol 2. Hong Kong, pp 1304\u20131311"},{"issue":"5","key":"3258_CR20","doi-asserted-by":"publisher","first-page":"638","DOI":"10.1504\/EJIE.2015.071777","volume":"9","author":"AA Kadri","year":"2015","unstructured":"Kadri AA, Labadi K, Kacem I (2015) An integrated petri net and genetic algorithm based approach for performance optimization of bicycle-sharing systems. Eur J Ind Eng 9(5):638\u2013663","journal-title":"Eur J Ind Eng"},{"issue":"2016","key":"3258_CR21","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.cie.2016.02.002","volume":"95","author":"AA Kadri","year":"2016","unstructured":"Kadri AA, Kacem I, Labadi K (2016) A branch-and-bound algorithm for solving the static rebalancing problem in bicycle-sharing systems. Comput Ind Eng 95(2016):41\u201352","journal-title":"Comput Ind Eng"},{"key":"3258_CR22","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1016\/j.pmcj.2010.07.002","volume":"6","author":"A Kaltenbrunner","year":"2010","unstructured":"Kaltenbrunner A, Meza R, Grivolla J, Codina J, Banchs R (2010) Urban cycles and mobility patterns: exploring and predicting trends in a bicycle-based public transport system. Pervasive Mob Comput 6:455\u2013466","journal-title":"Pervasive Mob Comput"},{"issue":"7","key":"3258_CR23","doi-asserted-by":"publisher","first-page":"8293","DOI":"10.1016\/j.eswa.2011.01.013","volume":"38","author":"CH Ko","year":"2011","unstructured":"Ko CH, Wang SF (2011) Precast production scheduling using multi-objective genetic algorithms. Expert Syst Appl 38(7):8293\u20138302","journal-title":"Expert Syst Appl"},{"issue":"4","key":"3258_CR24","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s10288-015-0301-z","volume":"13","author":"G Laporte","year":"2015","unstructured":"Laporte G, Meunier F, Calvo RW (2015) Shared mobility systems. 4OR 13(4):341\u2013360. https:\/\/doi.org\/10.1007\/s10288-015-0301-z","journal-title":"4OR"},{"key":"3258_CR25","first-page":"326","volume":"41","author":"K Martens","year":"2007","unstructured":"Martens K (2007) Promoting bike and ride: the Dutch experience. Transp Res Part A 41:326\u2013338","journal-title":"Transp Res Part A"},{"key":"3258_CR26","unstructured":"Meddin R, DeMaio P (2016) The bike sharing world map. http:\/\/www.metrobike.net\/"},{"key":"3258_CR27","first-page":"23","volume":"2","author":"P Midgley","year":"2009","unstructured":"Midgley P (2009) The role of smart bike-sharing systems in urban mobility. Journeys 2:23\u201331","journal-title":"Journeys"},{"issue":"2","key":"3258_CR28","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/s00500-014-1522-3","volume":"20","author":"G Pan","year":"2016","unstructured":"Pan G, Li K, Ouyang A, Li K (2016) Hybrid immune algorithm based on greedy algorithm and delete-cross operator for solving TSP. Soft Comput 20(2):555\u2013566","journal-title":"Soft Comput"},{"issue":"3","key":"3258_CR29","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(77)90012-3","volume":"4","author":"CH Papadimitriou","year":"1977","unstructured":"Papadimitriou CH (1977) The Euclidean travelling salesman problem is NP-complete. Theor Comput Sci 4(3):237\u2013244","journal-title":"Theor Comput Sci"},{"key":"3258_CR30","doi-asserted-by":"crossref","unstructured":"Papazek P, Raidl GR, Rainer-Harbach M, Hu B (2013) A PILOT\/VND\/GRASP hybrid for the static balancing of public bicycle-sharing systems. In: Moreno-Diaz R, Pichler F, Quesada-Arencibia A (eds) EUROCAST, vol 8111. LNCS, pp 372\u2013379","DOI":"10.1007\/978-3-642-53856-8_47"},{"issue":"6","key":"3258_CR31","first-page":"451","volume":"45","author":"J Pucher","year":"2011","unstructured":"Pucher J, Buehler R, Seinen M (2011) Bicycling renaissance in North America? An update and re-appraisal of cycling trends and policies. Transp Res 45(6):451\u2013475","journal-title":"Transp Res"},{"key":"3258_CR32","doi-asserted-by":"crossref","unstructured":"Rainer-Harbach M, Papazek P, Hu B, Raidl GR (2013) Balancing bicycle-sharing systems: a variable neighborhood search approach. In: Middendorf M, Blum C (eds) EvoCOP 2013, vol 7832. LNCS, pp 121\u2013132","DOI":"10.1007\/978-3-642-37198-1_11"},{"key":"3258_CR33","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/s13676-012-0017-6","volume":"2","author":"T Raviv","year":"2013","unstructured":"Raviv T, Tzur M, Forma I (2013) Static repositioning in a bike-sharing system: models and solution approaches. EURO J Transp Logist 2:187\u2013229","journal-title":"EURO J Transp Logist"},{"issue":"20","key":"3258_CR34","doi-asserted-by":"publisher","first-page":"5671","DOI":"10.1080\/00207543.2011.593578","volume":"50","author":"F Samanlioglu","year":"2012","unstructured":"Samanlioglu F, Ferrell WG, Kurz ME (2012) An interactive memetic algorithm for production and manufacturing problems modelled as a multi-objective travelling salesman problem. Int J Prod Res 50(20):5671\u20135682","journal-title":"Int J Prod Res"},{"key":"3258_CR35","doi-asserted-by":"crossref","unstructured":"Schulz AS (1996) Scheduling to minimize total weighted completion time: performance guarantees of LP-based heuristics and lower bounds. In: Proceedings of the 5th IPCO conference, pp 301\u2013315","DOI":"10.1007\/3-540-61310-2_23"},{"key":"3258_CR36","doi-asserted-by":"publisher","first-page":"159","DOI":"10.3141\/2143-20","volume":"2143","author":"SA Shaheen","year":"2010","unstructured":"Shaheen SA, Stacey G, Hua Z (2010) Bike sharing in Europe, the Americas, and Asia past, present, and future. J Transp Res Board 2143:159\u2013167","journal-title":"J Transp Res Board"},{"issue":"3","key":"3258_CR37","first-page":"81","volume":"1","author":"G Sharma","year":"2012","unstructured":"Sharma G, Abbas S, Gupt V (2012) Solving transportation problem with the various method of linear programming problem. Asian J Curr Eng Maths 1(3):81\u201383","journal-title":"Asian J Curr Eng Maths"},{"issue":"6","key":"3258_CR38","doi-asserted-by":"publisher","first-page":"1346","DOI":"10.1287\/opre.2013.1215","volume":"61","author":"J Shu","year":"2013","unstructured":"Shu J, Chou M, Liu Q, Teo CP, Wang IL (2013) Models for effective deployment and redistribution of bicycles within public bicycle-sharing systems. Oper Res 61(6):1346\u20131359","journal-title":"Oper Res"},{"key":"3258_CR39","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1016\/j.sbspro.2011.08.058","volume":"20","author":"P Vogel","year":"2011","unstructured":"Vogel P, Greisera T, Mattfeld D (2011) Understanding bike-sharing systems using data mining: exploring activity patterns. 14th EWGT, 26th MEC, 1st RH, Procedia Soc Behav Sci 20:514\u2013523","journal-title":"14th EWGT, 26th MEC, 1st RH, Procedia Soc Behav Sci"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-018-3258-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-018-3258-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-018-3258-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,24]],"date-time":"2022-08-24T20:38:34Z","timestamp":1661373514000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-018-3258-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,31]]},"references-count":39,"journal-issue":{"issue":"14","published-print":{"date-parts":[[2019,7]]}},"alternative-id":["3258"],"URL":"https:\/\/doi.org\/10.1007\/s00500-018-3258-y","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"type":"print","value":"1432-7643"},{"type":"electronic","value":"1433-7479"}],"subject":[],"published":{"date-parts":[[2018,5,31]]},"assertion":[{"value":"31 May 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"All authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Human and animal rights"}}]}}