{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T11:25:46Z","timestamp":1742988346194,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":20,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811534140"},{"type":"electronic","value":"9789811534157"}],"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"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-981-15-3415-7_26","type":"book-chapter","created":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T19:02:58Z","timestamp":1585767778000},"page":"310-325","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Scheduling Optimization of Vehicles Considering Customer Rank and Delivery Time Demand"],"prefix":"10.1007","author":[{"given":"Wenqiang","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hao","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianxiu","family":"Su","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,4,2]]},"reference":[{"key":"26_CR1","unstructured":"http:\/\/www.chinawuliu.com.cn\/lhhkx\/201802\/06\/328520.shtml\n\n. [EB\/OL]"},{"issue":"3","key":"26_CR2","first-page":"55","volume":"9","author":"A Tenahua","year":"2018","unstructured":"Tenahua, A., Olivares, B.E., Diana, S.: ILS metaheuristic to solve the periodic vehicle routing problem. Int. J. Comb. Optim. Probl. Inform. 9(3), 55\u201363 (2018)","journal-title":"Int. J. Comb. Optim. Probl. Inform."},{"issue":"3","key":"26_CR3","doi-asserted-by":"publisher","first-page":"844","DOI":"10.1016\/j.ejor.2018.02.023","volume":"269","author":"AS Elgesem","year":"2018","unstructured":"Elgesem, A.S., Skogen, E.S., Wang, X.: A traveling salesman problem with pickups and deliveries and stochastic travel times: an application from chemical shipping. Eur. J. Oper. Res. 269(3), 844\u2013859 (2018)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"26_CR4","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1016\/j.engappai.2007.06.001","volume":"21","author":"W Ho","year":"2008","unstructured":"Ho, W., Ho, G.T.S., Ji, P., et al.: A hybrid genetic algorithm for the multi-depot vehicle routing problem. Eng. Appl. Artif. Intell. 21(4), 548\u2013557 (2008)","journal-title":"Eng. Appl. Artif. Intell."},{"key":"26_CR5","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.eswa.2016.09.017","volume":"66","author":"CB Kalayci","year":"2016","unstructured":"Kalayci, C.B., Kaya, C.: An ant colony system empowered variable neighborhood search algorithm for the vehicle routing problem with simultaneous pickup and delivery. Expert Syst. Appl. 66, 163\u2013175 (2016)","journal-title":"Expert Syst. Appl."},{"key":"26_CR6","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.cor.2013.05.011","volume":"52","author":"S Salhi","year":"2014","unstructured":"Salhi, S., Imaran, A., Wassan, N.A.: The multi-depot vehicle routing problem with heterogeneous vehicle fleet: formulation and a variable neighborhood search implementation. Comput. Oper. Res. 52, 315\u2013325 (2014)","journal-title":"Comput. Oper. Res."},{"issue":"16","key":"26_CR7","doi-asserted-by":"publisher","first-page":"7495","DOI":"10.1016\/j.eswa.2014.06.010","volume":"41","author":"VWC Morais","year":"2014","unstructured":"Morais, V.W.C., Mateus, G.R., Noronha, T.F.: Iterated local search heuristics for the vehicle routing problem with cross-docking. Expert Syst. Appl. 41(16), 7495\u20137506 (2014)","journal-title":"Expert Syst. Appl."},{"issue":"14","key":"26_CR8","doi-asserted-by":"publisher","first-page":"1540031","DOI":"10.1142\/S0218127415400313","volume":"25","author":"Q Song","year":"2015","unstructured":"Song, Q., Gao, X., Santos, E.T.: A food chain algorithm for capacitated vehicle routing problem with recycling in reverse logistics. Int. J. Bifurcat. Chaos 25(14), 1540031 (2015)","journal-title":"Int. J. Bifurcat. Chaos"},{"key":"26_CR9","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1016\/j.cor.2016.12.023","volume":"81","author":"PV Silvestrin","year":"2017","unstructured":"Silvestrin, P.V., Ritt, M.: An iterated tabu search for the multi-compartment vehicle routing problem. Comput. Oper. Res. 81, 192\u2013202 (2017)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"26_CR10","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1016\/j.ejor.2013.04.044","volume":"230","author":"R Liu","year":"2013","unstructured":"Liu, R., Xie, X., Augusto, V., et al.: Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care. Eur. J. Oper. Res. 230(3), 475\u2013486 (2013)","journal-title":"Eur. J. Oper. Res."},{"key":"26_CR11","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.cor.2017.02.007","volume":"83","author":"C Defryn","year":"2017","unstructured":"Defryn, C., Sorensen, K.: A fast two-level variable neighborhood search for the clustered vehicle routing problem. Comput. Oper. Res. 83, 78\u201394 (2017)","journal-title":"Comput. Oper. Res."},{"issue":"8","key":"26_CR12","doi-asserted-by":"publisher","first-page":"1254","DOI":"10.1080\/01605682.2017.1390534","volume":"69","author":"P Vaz","year":"2018","unstructured":"Vaz, P., Puca, H., Santos, A.C., et al.: Vehicle routing problems for last mile distribution after major disaster. J. Oper. Res. Soc. 69(8), 1254\u20131268 (2018)","journal-title":"J. Oper. Res. Soc."},{"issue":"11","key":"26_CR13","first-page":"32","volume":"22","author":"X Li","year":"2002","unstructured":"Li, X., Shao, Z., Qian, J.: An optimizing method based on autonomous animats: fish swarm algorithm. Syst. Eng. Theory Pract. 22(11), 32\u201338 (2002)","journal-title":"Syst. Eng. Theory Pract."},{"key":"26_CR14","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1016\/j.cma.2018.04.037","volume":"339","author":"W Zhao","year":"2018","unstructured":"Zhao, W., Du, C., Jiang, S.: An adaptive multiscale approach for identifying multiple flaws based on XFEM and a discrete artificial fish swarm algorithm. Comput. Methods Appl. Mech. Eng. 339, 341\u2013357 (2018)","journal-title":"Comput. Methods Appl. Mech. Eng."},{"issue":"8","key":"26_CR15","doi-asserted-by":"publisher","first-page":"5367","DOI":"10.1016\/j.asoc.2011.05.022","volume":"11","author":"HC Tsai","year":"2011","unstructured":"Tsai, H.C., Lin, Y.: Modification of the fish swarm algorithm with particle swarm optimization formulation and communication behavior. Appl. Soft Comput. 11(8), 5367\u20135374 (2011)","journal-title":"Appl. Soft Comput."},{"key":"26_CR16","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/j.eswa.2017.05.053","volume":"86","author":"Z Zhang","year":"2017","unstructured":"Zhang, Z., Wang, K., Zhu, L., et al.: A pareto improved artificial fish swarm algorithm for solving a multi-objective fuzzy disassembly line balancing problem. Expert Syst. Appl. 86, 165\u2013176 (2017)","journal-title":"Expert Syst. Appl."},{"issue":"4","key":"26_CR17","doi-asserted-by":"publisher","first-page":"1979","DOI":"10.1007\/s11277-016-3340-7","volume":"94","author":"P Sengottuvelan","year":"2017","unstructured":"Sengottuvelan, P., Prasath, N.: BAFSA: breeding artificial fish swarm algorithm for optimal cluster head selection in wireless sensor networks. Wirel. Pers. Commun. 94(4), 1979\u20131991 (2017)","journal-title":"Wirel. Pers. Commun."},{"key":"26_CR18","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/j.swevo.2013.09.002","volume":"14","author":"M Azad","year":"2014","unstructured":"Azad, M., Rocha, A., Fernandes, E.: Improved binary artificial fish swarm algorithm for the 0\u20131 multidimensional knapsack problems. Swarm Evol. Comput. 14, 66\u201375 (2014)","journal-title":"Swarm Evol. Comput."},{"issue":"12","key":"26_CR19","doi-asserted-by":"publisher","first-page":"3907","DOI":"10.1007\/s00500-017-2601-z","volume":"22","author":"S Xian","year":"2017","unstructured":"Xian, S., Zhang, J., Xiao, Y., Pang, J.: A novel fuzzy time series forecasting method based on the improved artificial fish swarm optimization algorithm. Soft. Comput. 22(12), 3907\u20133917 (2017). \nhttps:\/\/doi.org\/10.1007\/s00500-017-2601-z","journal-title":"Soft. Comput."},{"issue":"6","key":"26_CR20","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1049\/iet-its.2017.0199","volume":"12","author":"Y Zhang","year":"2018","unstructured":"Zhang, Y., Huang, G.: Traffic flow prediction model based on deep belief network and genetic algorithm. IET Intel. Transp. Syst. 12(6), 533\u2013541 (2018)","journal-title":"IET Intel. Transp. Syst."}],"container-title":["Communications in Computer and Information Science","Bio-inspired Computing: Theories and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-15-3415-7_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,2]],"date-time":"2020-04-02T01:24:30Z","timestamp":1585790670000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-15-3415-7_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9789811534140","9789811534157"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-981-15-3415-7_26","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"2 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"BIC-TA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Bio-Inspired Computing: Theories and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Zhengzhou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 November 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 November 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"bicta2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/2019.bicta.org","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":"197","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":"121","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":"61% - 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":"3","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":"3","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)"}}]}}