{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,12]],"date-time":"2025-07-12T01:05:20Z","timestamp":1752282320959,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030597467"},{"type":"electronic","value":"9783030597474"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-59747-4_12","type":"book-chapter","created":{"date-parts":[[2020,9,26]],"date-time":"2020-09-26T11:02:30Z","timestamp":1601118150000},"page":"183-199","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Solving a Bi-Objective Rich Vehicle Routing Problem with Customer Prioritization"],"prefix":"10.1007","author":[{"given":"Tim","family":"van Benthem","sequence":"first","affiliation":[]},{"given":"Mark","family":"Bergman","sequence":"additional","affiliation":[]},{"given":"Martijn","family":"Mes","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,22]]},"reference":[{"issue":"4","key":"12_CR1","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/s40092-016-0163-9","volume":"12","author":"M Afshar-Bakeshloo","year":"2016","unstructured":"Afshar-Bakeshloo, M., Mehrabi, A., Safari, H., Maleki, M., Jolai, F.: A green vehicle routing problem with customer satisfaction criteria. J. Ind. Eng. Int. 12(4), 529\u2013544 (2016). \nhttps:\/\/doi.org\/10.1007\/s40092-016-0163-9","journal-title":"J. Ind. Eng. Int."},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2666003","volume":"47","author":"J Caceres Cruz","year":"2014","unstructured":"Caceres Cruz, J., Arias, P., Guimarans, D., Riera, D., Juan, A.: Rich vehicle routing problem: survey. ACM Comput. Surv. 47, 1\u201328 (2014)","journal-title":"ACM Comput. Surv."},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Cao, E., Lai, M.: An improved differential evolution algorithm for the vehicle routing problem with simultaneous delivery and pick-up service. In: Third International Conference on Natural Computation, ICNC 2007, vol. 3, pp. 436\u2013440, August 2007","DOI":"10.1109\/ICNC.2007.209"},{"key":"12_CR4","first-page":"155","volume":"28","author":"S Feng","year":"2016","unstructured":"Feng, S., Wu, H., Sun, X., Li, Z.: Factors of perceived waiting time and implications on passengers\u2019 satisfaction with waiting time. PROMET - Traffic Transp. 28, 155\u2013163 (2016)","journal-title":"PROMET - Traffic Transp."},{"issue":"2","key":"12_CR5","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1007\/s10878-012-9564-x","volume":"28","author":"SF Ghannadpour","year":"2014","unstructured":"Ghannadpour, S.F., Noori, S., Tavakkoli-Moghaddam, R.: A multi-objective vehicle routing and scheduling problem with uncertainty in customers\u2019 request and priority. J. Comb. Optimiz. 28(2), 414\u2013446 (2014)","journal-title":"J. Comb. Optimiz."},{"issue":"5","key":"12_CR6","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1509\/jmkg.72.5.110","volume":"72","author":"C Homburg","year":"2008","unstructured":"Homburg, C., Droll, M., Totzek, D.: Customer prioritization: does it pay off, and how should it be implemented? J. Mark. 72(5), 110\u2013130 (2008)","journal-title":"J. Mark."},{"issue":"4598","key":"12_CR7","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671\u2013680 (1983)","journal-title":"Science"},{"issue":"8","key":"12_CR8","doi-asserted-by":"publisher","first-page":"6949","DOI":"10.1016\/j.eswa.2012.01.024","volume":"39","author":"Y Kuo","year":"2012","unstructured":"Kuo, Y., Wang, C.C.: A variable neighborhood search for the multi-depot vehicle routing problem with loading cost. Expert Syst. Appl. 39(8), 6949\u20136954 (2012)","journal-title":"Expert Syst. Appl."},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/978-3-030-38629-0_24","volume-title":"Learning and Intelligent Optimization","author":"E Lalla-Ruiz","year":"2020","unstructured":"Lalla-Ruiz, E., Heilig, L., Vo\u00df, S.: Assessing simulated annealing with variable neighborhoods. In: Matsatsinis, N.F., Marinakis, Y., Pardalos, P. (eds.) LION 2019. LNCS, vol. 11968, pp. 298\u2013303. Springer, Cham (2020). \nhttps:\/\/doi.org\/10.1007\/978-3-030-38629-0_24"},{"key":"12_CR10","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1002\/net.3230110211","volume":"11","author":"J Lenstra","year":"2006","unstructured":"Lenstra, J., Kan, A.: Complexity of vehicle routing and scheduling problems. Networks 11, 221\u2013227 (2006)","journal-title":"Networks"},{"issue":"2","key":"12_CR11","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/j.engappai.2009.09.001","volume":"23","author":"L Mingyong","year":"2010","unstructured":"Mingyong, L., Erbao, C.: An improved differential evolution algorithm for vehicle routing problem with simultaneous pickups and deliveries and time windows. Eng. Appl. Artif. Intell. 23(2), 188\u2013195 (2010)","journal-title":"Eng. Appl. Artif. Intell."},{"issue":"11","key":"12_CR12","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24(11), 1097\u20131100 (1997)","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"12_CR13","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/BF02023004","volume":"41","author":"IH Osman","year":"1993","unstructured":"Osman, I.H.: Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Ann. Oper. Res. 41(4), 421\u2013451 (1993). \nhttps:\/\/doi.org\/10.1007\/BF02023004","journal-title":"Ann. Oper. Res."},{"key":"12_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48661-5","volume-title":"The Traveling Salesman: Computational Solutions for TSP Applications","author":"G Reinelt","year":"1994","unstructured":"Reinelt, G.: The Traveling Salesman: Computational Solutions for TSP Applications. Springer, Heidelberg (1994). \nhttps:\/\/doi.org\/10.1007\/3-540-48661-5"},{"issue":"4","key":"12_CR15","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0191-2615(90)90002-G","volume":"24","author":"F Robuste","year":"1990","unstructured":"Robuste, F., Daganzo, C.F., Souleyrette, R.R.: Implementing vehicle routing models. Transp. Res. Part B: Methodol. 24(4), 263\u2013286 (1990)","journal-title":"Transp. Res. Part B: Methodol."},{"key":"12_CR16","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1287\/trsc.1110.0396","volume":"47","author":"A Stenger","year":"2013","unstructured":"Stenger, A., Vigo, D., Enz, S., Schwind, M.: An adaptive variable neighborhood search algorithm for a vehicle routing problem arising in small package shipping. Transp. Sci. 47, 64\u201380 (2013)","journal-title":"Transp. Sci."},{"key":"12_CR17","doi-asserted-by":"publisher","DOI":"10.1002\/9780470496916","volume-title":"Metaheuristics: From Design to Implementation","author":"EG Talbi","year":"2009","unstructured":"Talbi, E.G.: Metaheuristics: From Design to Implementation, vol. 74. Wiley, Hoboken (2009)"},{"issue":"2","key":"12_CR18","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1016\/j.amc.2005.09.040","volume":"176","author":"R Tavakkoli-Moghaddam","year":"2006","unstructured":"Tavakkoli-Moghaddam, R., Safaei, N., Gholipour, Y.: A hybrid simulated annealing for capacitated vehicle routing problems with the independent route length. Appl. Math. Comput. 176(2), 445\u2013454 (2006)","journal-title":"Appl. Math. Comput."},{"key":"12_CR19","doi-asserted-by":"publisher","first-page":"1427","DOI":"10.3233\/IFS-151578","volume":"29","author":"Y Wang","year":"2015","unstructured":"Wang, Y., Ma, X., Xu, M., Wang, Y., Liu, Y.: Vehicle routing problem based on a fuzzy customer clustering approach for logistics network optimization. J. Intell. Fuzzy Syst. 29, 1427\u20131442 (2015)","journal-title":"J. Intell. Fuzzy Syst."},{"key":"12_CR20","series-title":"Operations Research\/Computer Science Interfaces","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/978-0-387-77778-8_21","volume-title":"The Vehicle Routing Problem: Latest Advances and New Challenges","author":"RT Wong","year":"2008","unstructured":"Wong, R.T.: Vehicle routing for small package delivery and pickup services. In: Golden, B., Raghavan, S., Wasil, E. (eds.) The Vehicle Routing Problem: Latest Advances and New Challenges. ORCS, vol. 43, pp. 475\u2013485. Springer, Boston (2008). \nhttps:\/\/doi.org\/10.1007\/978-0-387-77778-8_21"},{"issue":"4","key":"12_CR21","doi-asserted-by":"publisher","first-page":"118","DOI":"10.2307\/41166104","volume":"43","author":"VA Zeithaml","year":"2001","unstructured":"Zeithaml, V.A., Rust, R.T., Lemon, K.N.: The customer pyramid: creating and serving profitable customers. Calif. Manag. Rev. 43(4), 118\u2013142 (2001)","journal-title":"Calif. Manag. Rev."},{"issue":"10","key":"12_CR22","doi-asserted-by":"publisher","first-page":"2277","DOI":"10.1016\/j.cor.2011.11.021","volume":"39","author":"T Zhang","year":"2012","unstructured":"Zhang, T., Chaovalitwongse, W.A., Zhang, Y.: Scatter search for the stochastic travel-time vehicle routing problem with simultaneous pick-ups and deliveries. Comput. Oper. Res. 39(10), 2277\u20132290 (2012)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"12_CR23","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/s10878-014-9741-1","volume":"28","author":"T Zhang","year":"2014","unstructured":"Zhang, T., Chaovalitwongse, W.A., Zhang, Y.: Integrated ant colony and tabu search approach for time dependent vehicle routing problems with simultaneous pickup and delivery. J. Comb. Optimiz. 28(1), 288\u2013309 (2014). \nhttps:\/\/doi.org\/10.1007\/s10878-014-9741-1","journal-title":"J. Comb. Optimiz."}],"container-title":["Lecture Notes in Computer Science","Computational Logistics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-59747-4_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,2]],"date-time":"2020-11-02T09:08:46Z","timestamp":1604308126000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-59747-4_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030597467","9783030597474"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-59747-4_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"22 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCL","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Logistics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Enschede","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccl22020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iccl2020.nl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"73","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"49","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"67% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2,5","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}