{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T00:27:44Z","timestamp":1772756864574,"version":"3.50.1"},"reference-count":38,"publisher":"Emerald","issue":"8","license":[{"start":{"date-parts":[[2020,7,19]],"date-time":"2020-07-19T00:00:00Z","timestamp":1595116800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.emerald.com\/insight\/site-policies"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IMDS"],"published-print":{"date-parts":[[2020,7,19]]},"abstract":"<jats:sec><jats:title content-type=\"abstract-subheading\">Purpose<\/jats:title><jats:p>This paper aims to explore the commodity transshipment planning among customers, which is commonly observed in production\/sales enterprises to save the operational costs.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-subheading\">Design\/methodology\/approach<\/jats:title><jats:p>A mixed integer programming (MIP) model is built and five types of valid inequalities for tightening the solution space are derived. An improved variable neighborhood search (IVNS) algorithm is presented combining the developed multistart initial solution strategy and modified neighborhood local search procedure.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-subheading\">Findings<\/jats:title><jats:p>Experimental results demonstrate that: with less decision variables considered, the proposed model can solve more instances compared to the existing model in previous literature. The valid inequalities utilized to tighten the searching space can efficiently help the model to obtain optimal solutions or high-quality lower bounds. The improved algorithm is efficient to obtain optimal or near-optimal solutions and superior to the compared algorithm in terms of solution quality, computational time and robustness.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-subheading\">ractical implications<\/jats:title><jats:p>This research not only can help reduce operational costs and improve logistics efficiency for relevant enterprises, but also can provide guidance for constructing the decision support system of logistics intelligent scheduling platform to cater for centralized management and control.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-subheading\">Originality\/value<\/jats:title><jats:p>This paper develops a more compact model and some stronger valid inequalities. Moreover, the proposed algorithm is easy to implement and performs well.<\/jats:p><\/jats:sec>","DOI":"10.1108\/imds-01-2020-0050","type":"journal-article","created":{"date-parts":[[2020,7,20]],"date-time":"2020-07-20T22:38:32Z","timestamp":1595284712000},"page":"1565-1584","source":"Crossref","is-referenced-by-count":13,"title":["A multicommodity unpaired pickup and delivery vehicle routing problem with split loads and unloads"],"prefix":"10.1108","volume":"120","author":[{"given":"Xu","family":"Dongyang","sequence":"first","affiliation":[]},{"given":"Li","family":"Kunpeng","sequence":"additional","affiliation":[]},{"given":"Yang","family":"Jiehui","sequence":"additional","affiliation":[]},{"given":"Cui","family":"Ligang","sequence":"additional","affiliation":[]}],"member":"140","reference":[{"issue":"2","key":"key2020081110424711000_ref001","first-page":"563","article-title":"Mathematical model and heuristic approach for solving dynamic vehicle routing problem with simultaneous pickup and delivery: random iterative local search variable neighborhood descent search","volume":"35","year":"2020","journal-title":"Journal of the faculty of Engineering and Architecture of gazi university"},{"issue":"2","key":"key2020081110424711000_ref002","doi-asserted-by":"crossref","first-page":"508","DOI":"10.1016\/j.ejor.2017.06.028","article-title":"The static bike relocation problem with multiple vehicles and visits","volume":"264","year":"2018","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"key2020081110424711000_ref003","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1016\/j.disopt.2012.11.005","article-title":"Bike sharing systems: solving the static rebalancing problem","volume":"10","year":"2013","journal-title":"Discrete Optimization"},{"key":"key2020081110424711000_ref004","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1016\/j.tre.2014.06.010","article-title":"Model and algorithm for an unpaired pickup and delivery vehicle routing problem with split loads","volume":"69","year":"2014","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"key":"key2020081110424711000_ref005","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/j.cor.2016.09.025","article-title":"A heuristic algorithm for a single vehicle static bike sharing rebalancing problem","volume":"79","year":"2017","journal-title":"Computers and Operations Research"},{"key":"key2020081110424711000_ref006","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/j.omega.2013.12.001","article-title":"The bike sharing rebalancing problem: mathematical formulations and benchmark instances","volume":"45","year":"2014","journal-title":"Omega"},{"key":"key2020081110424711000_ref007","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/j.cor.2016.01.011","article-title":"A destroy and repair algorithm for the Bike sharing Rebalancing Problem","volume":"71","year":"2016","journal-title":"Computers and Operations Research"},{"key":"key2020081110424711000_ref008","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1016\/j.trb.2018.10.015","article-title":"The bike sharing rebalancing problem with stochastic demands","volume":"118","year":"2018","journal-title":"Transportation Research Part B: Methodological"},{"key":"key2020081110424711000_ref009","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1016\/j.ejor.2014.04.013","article-title":"The static bicycle relocation problem with demand intervals","volume":"238","year":"2014","journal-title":"European Journal of Operational Research"},{"key":"key2020081110424711000_ref010","doi-asserted-by":"crossref","first-page":"667","DOI":"10.1016\/j.ejor.2015.03.043","article-title":"An exact algorithm for the static rebalancing problem arising in bicycle sharing systems","volume":"245","year":"2015","journal-title":"European Journal of Operational Research"},{"key":"key2020081110424711000_ref011","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1016\/j.trb.2014.10.003","article-title":"A 3-step math heuristic for the static repositioning problem in bike-sharing systems","volume":"71","year":"2015","journal-title":"Transportation Research Part B: Methodological"},{"key":"key2020081110424711000_ref012","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1007\/s10601-015-9182-1","article-title":"Balancing bike sharing systems with constraint programming","volume":"21","year":"2016","journal-title":"Constraints"},{"key":"key2020081110424711000_ref013","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1016\/j.ejor.2015.10.053","article-title":"A hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling salesman problem","volume":"251","year":"2016","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"key2020081110424711000_ref014","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1287\/trsc.1030.0086","article-title":"Heuristics for the one-commodity pickup-and-delivery traveling salesman problem","volume":"38","year":"2004","journal-title":"Transportation Science"},{"issue":"2","key":"key2020081110424711000_ref015","first-page":"258","article-title":"The one-commodity pickup-and-delivery traveling salesman problem: inequalities and algorithms","volume":"50","year":"2007","journal-title":"Networks"},{"issue":"1","key":"key2020081110424711000_ref016","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1002\/net.21521","article-title":"The multi-commodity pickup-and-delivery traveling salesman problem","volume":"63","year":"2014","journal-title":"Networks"},{"key":"key2020081110424711000_ref017","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1016\/j.tre.2014.05.017","article-title":"Solving a static repositioning problem in bike-sharing systems using iterated tabu search","volume":"69","year":"2014","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"key":"key2020081110424711000_ref018","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1016\/j.trb.2016.11.003","article-title":"A hybrid large neighborhood search for the static multi-vehicle bike-repositioning problem","volume":"95","year":"2017","journal-title":"Transportation Research Part B: Methodological"},{"key":"key2020081110424711000_ref019","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/j.cie.2016.02.002","article-title":"A branch-and-bound algorithm for solving the static rebalancingproblem in bicycle-sharing systems","volume":"95","year":"2016","journal-title":"Computers and Industrial Engineering"},{"key":"key2020081110424711000_ref020","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1016\/j.trb.2018.01.009","article-title":"Continuous approximation for demand balancing in solving large-scale one-commodity pickup and delivery problems","volume":"109","year":"2018","journal-title":"Transportation Research Part B: Methodological"},{"key":"key2020081110424711000_ref021","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/j.trb.2016.05.010","article-title":"A multiple type bike repositioning problem","volume":"90","year":"2016","journal-title":"Transportation Research Part B: Methodological"},{"key":"key2020081110424711000_ref022","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/j.omega.2018.09.014","article-title":"A branch-and-price-and-cut algorithm for a pickup and delivery problem in retailing","volume":"89","year":"2019","journal-title":"Omega"},{"key":"key2020081110424711000_ref023","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/j.cor.2018.08.006","article-title":"A population algorithm based on randomized tabuthresholding for the multi-commodity pickup-and-delivery traveling salesman problem","volume":"101","year":"2019","journal-title":"Computers and Operations Research"},{"issue":"1","key":"key2020081110424711000_ref024","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1016\/j.ejor.2018.12.031","article-title":"Stochastic optimization models for a bike-sharing problem with transshipment","volume":"276","year":"2019","journal-title":"European Journal of Operational Research"},{"key":"key2020081110424711000_ref025","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/j.ejor.2012.01.036","article-title":"A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem","volume":"220","year":"2012","journal-title":"European Journal of Operational Research"},{"issue":"11","key":"key2020081110424711000_ref026","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","article-title":"Variable neighborhood search","volume":"24","year":"1997","journal-title":"Computers and Operations Research"},{"key":"key2020081110424711000_ref027","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1016\/j.trc.2017.03.016","article-title":"Free-floating bike sharing: solving real-life large-scale static rebalancing problems","volume":"80","year":"2017","journal-title":"Transportation Research Part C: Emerging Technologies"},{"key":"key2020081110424711000_ref028","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/j.cor.2017.03.009","article-title":"A parallel variable neighborhood search for the vehicle routing problem with divisible deliveries and pickups","volume":"85","year":"2017","journal-title":"Computers and Operations Research"},{"key":"key2020081110424711000_ref029","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/s13676-012-0017-6","article-title":"Static repositioning in a bike-sharing system: models and solution approaches","volume":"2","year":"2013","journal-title":"EURO, Journal on Transportation and Logistics"},{"key":"key2020081110424711000_ref030","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1016\/j.trb.2015.02.014","article-title":"The split-demand one-commodity pickup-and-delivery travelling salesman problem","volume":"75","year":"2015","journal-title":"Transportation Research Part B: Methodological"},{"key":"key2020081110424711000_ref031","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1287\/trsc.29.1.17","article-title":"The general pickup and delivery problem","volume":"29","year":"1995","journal-title":"Transportation Science"},{"issue":"3","key":"key2020081110424711000_ref032","doi-asserted-by":"crossref","first-page":"992","DOI":"10.1016\/j.ejor.2016.08.029","article-title":"Inventory rebalancing and vehicle routing in bike sharing systems","volume":"257","year":"2017","journal-title":"European Journal of Operational Research"},{"key":"key2020081110424711000_ref033","first-page":"175","article-title":"Genetic algorithm for the one-commodity pickup-and-delivery vehicle routing problem","year":"2009"},{"key":"key2020081110424711000_ref034","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1016\/j.trd.2016.05.005","article-title":"Chemical reaction optimization for solving a static bike repositioning problem","volume":"47","year":"2016","journal-title":"Transportation Research Part D: Transport and Environment"},{"key":"key2020081110424711000_ref035","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1016\/j.tre.2017.04.011","article-title":"An unpaired pickup and delivery vehicle routing problem with multi-visit","volume":"103","year":"2017","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"issue":"1","key":"key2020081110424711000_ref036","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1108\/EC-11-2015-0334","article-title":"An artificial intelligent approach to the bicycle repositioning problems","volume":"34","year":"2017","journal-title":"Engineering Computations"},{"key":"key2020081110424711000_ref037","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1016\/j.apm.2019.04.030","article-title":"A two-phase heuristic approach to the bike repositioning problem","volume":"73","year":"2019","journal-title":"Applied Mathematical Modelling"},{"key":"key2020081110424711000_ref038","doi-asserted-by":"crossref","first-page":"1642","DOI":"10.1016\/j.cie.2008.10.014","article-title":"Genetic algorithm for the one-commodity pickup-and-delivery traveling salesman problem","volume":"56","year":"2009","journal-title":"Computers and Industrial Engineering"}],"container-title":["Industrial Management &amp; Data Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/IMDS-01-2020-0050\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/IMDS-01-2020-0050\/full\/html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T21:51:05Z","timestamp":1753393865000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.emerald.com\/imds\/article\/120\/8\/1565-1584\/514076"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,19]]},"references-count":38,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2020,7,19]]}},"alternative-id":["10.1108\/IMDS-01-2020-0050"],"URL":"https:\/\/doi.org\/10.1108\/imds-01-2020-0050","relation":{},"ISSN":["0263-5577"],"issn-type":[{"value":"0263-5577","type":"print"}],"subject":[],"published":{"date-parts":[[2020,7,19]]}}}