IDEAS home Printed from https://ideas.repec.org/a/eee/transb/v133y2020icp1-20.html
   My bibliography  Save this article

Variable neighborhood search and tabu search for auction-based waste collection synchronization

Author

Listed:
  • Shao, Saijun
  • Xu, Su Xiu
  • Huang, George Q.

Abstract

We study a less-than-truckload (LTL) transportation service procurement (TSP) in the waste collection industry, where shippers make small-volume requests and a single carrier optimizes the collection routes to realize maximum profitability. In our proposed auction-based waste collection synchronization (A-WCS) mechanism, the carrier plays a role as the auctioneer to decide on who wins the bids and the corresponding payments while the shippers act as the bidders. This is attributed to the carrier-centric structure where a carrier has to consolidate multiple LTL shipping requests so as to provide cost-effective services. Furthermore, a single shipper (e.g., a construction site) may generate multiple types of waste and highly desires for a synchronous service, requiring multiple vehicles dedicated for different waste types to arrive almost simultaneously. The synchronization is beneficial to prevent repeated handling and reduce disruption caused to the minimum. The synchronization requirements are innovatively factored by incorporating time windows into each customer bid. The A-WCS mechanism can encourage truthful bidding from shippers and obtain fair payments for both sides, therefore can benefit the market in the long run. A-WCS problems are extremely difficult to solve due to the integration of two combinatorial problems. We address the A-WCS with a two-layered algorithm, where the variable neighborhood search (VNS) is purposed to search auction allocations in the upper layer and tabu search (TS) is conducted to generate efficient vehicle routes in the lower layer. The capability of our algorithm is demonstrated by an extensive computational study, comparing with a number of state-of-the-art exact and heuristic approaches. Finally, a number of managerial implications for the practitioners are obtained, with insights into the impacts caused by changes in market size, task complexity, customer distribution pattern, and auction frequency.

Suggested Citation

  • Shao, Saijun & Xu, Su Xiu & Huang, George Q., 2020. "Variable neighborhood search and tabu search for auction-based waste collection synchronization," Transportation Research Part B: Methodological, Elsevier, vol. 133(C), pages 1-20.
    • Handle: RePEc:eee:transb:v:133:y:2020:i:c:p:1-20
    DOI: 10.1016/j.trb.2019.12.004
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0191261519302978
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.trb.2019.12.004?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Lafkihi, Mariam & Pan, Shenle & Ballot, Eric, 2019. "Freight transportation service procurement: A literature review and future research opportunities in omnichannel E-commerce," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 125(C), pages 348-365.
    2. Garrido, Rodrigo A., 2007. "Procurement of transportation services in spot markets under a double-auction scheme with elastic demand," Transportation Research Part B: Methodological, Elsevier, vol. 41(9), pages 1067-1078, November.
    3. Zhang, Bo & Yao, Tao & Friesz, Terry L. & Sun, Yuqi, 2015. "A tractable two-stage robust winner determination model for truckload service procurement via combinatorial auctions," Transportation Research Part B: Methodological, Elsevier, vol. 78(C), pages 16-31.
    4. Nguyen, Phuong Khanh & Crainic, Teodor Gabriel & Toulouse, Michel, 2013. "A tabu search for Time-dependent Multi-zone Multi-trip Vehicle Routing Problem with Time Windows," European Journal of Operational Research, Elsevier, vol. 231(1), pages 43-56.
    5. Lai, Minghui & Cai, Xiaoqiang & Hu, Qian, 2017. "An iterative auction for carrier collaboration in truckload pickup and delivery," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 107(C), pages 60-80.
    6. Edward Clarke, 1971. "Multipart pricing of public goods," Public Choice, Springer, vol. 11(1), pages 17-33, September.
    7. Marius M. Solomon, 1987. "Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints," Operations Research, INFORMS, vol. 35(2), pages 254-265, April.
    8. Brandao, Jose & Mercer, Alan, 1997. "A tabu search algorithm for the multi-trip vehicle routing and scheduling problem," European Journal of Operational Research, Elsevier, vol. 100(1), pages 180-191, July.
    9. William Vickrey, 1961. "Counterspeculation, Auctions, And Competitive Sealed Tenders," Journal of Finance, American Finance Association, vol. 16(1), pages 8-37, March.
    10. Xu, Su Xiu & Huang, George Q., 2013. "Transportation service procurement in periodic sealed double auctions with stochastic demand and supply," Transportation Research Part B: Methodological, Elsevier, vol. 56(C), pages 136-160.
    11. S.J. Rassenti & V.L. Smith & R.L. Bulfin, 1982. "A Combinatorial Auction Mechanism for Airport Time Slot Allocation," Bell Journal of Economics, The RAND Corporation, vol. 13(2), pages 402-417, Autumn.
    12. Fred Glover, 1990. "Tabu Search—Part II," INFORMS Journal on Computing, INFORMS, vol. 2(1), pages 4-32, February.
    13. Markov, Iliya & Varone, Sacha & Bierlaire, Michel, 2016. "Integrating a heterogeneous fixed fleet and a flexible assignment of destination depots in the waste collection VRP with intermediate facilities," Transportation Research Part B: Methodological, Elsevier, vol. 84(C), pages 256-273.
    14. Fred Glover, 1989. "Tabu Search---Part I," INFORMS Journal on Computing, INFORMS, vol. 1(3), pages 190-206, August.
    15. Li, Li & Zhang, Rachel Q., 2015. "Cooperation through capacity sharing between competing forwarders," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 75(C), pages 115-131.
    16. Margaretha Gansterer & Richard F. Hartl, 2018. "Centralized bundle generation in auction-based collaborative transportation," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 40(3), pages 613-635, July.
    17. R. Jothi Basu & Nachiappan Subramanian & Naoufel Cheikhrouhou, 2015. "Review of Full Truckload Transportation Service Procurement," Transport Reviews, Taylor & Francis Journals, vol. 35(5), pages 599-621, September.
    18. Mariam Lafkihi & Shenle Pan & Eric Ballot, 2019. "Freight transportation service procurement: A literature review and future research opportunities in omnichannel E-commerce," Post-Print hal-02086154, HAL.
    19. Atanu Sengupta & Sanjoy De, 2020. "Review of Literature," India Studies in Business and Economics, in: Assessing Performance of Banks in India Fifty Years After Nationalization, chapter 0, pages 15-30, Springer.
    20. Sze, Jeeu Fong & Salhi, Said & Wassan, Niaz, 2017. "The cumulative capacitated vehicle routing problem with min-sum and min-max objectives: An effective hybridisation of adaptive variable neighbourhood search and large neighbourhood search," Transportation Research Part B: Methodological, Elsevier, vol. 101(C), pages 162-184.
    21. Cortinhal, Maria João & Mourão, Maria Cândida & Nunes, Ana Catarina, 2016. "Local search heuristics for sectoring routing in a household waste collection context," European Journal of Operational Research, Elsevier, vol. 255(1), pages 68-79.
    22. Van Engeland, Jens & Beliën, Jeroen & De Boeck, Liesje & De Jaeger, Simon, 2020. "Literature review: Strategic network optimization models in waste reverse supply chains," Omega, Elsevier, vol. 91(C).
    23. Hof, Julian & Schneider, Michael & Goeke, Dominik, 2017. "Solving the battery swap station location-routing problem with capacitated electric vehicles using an AVNS algorithm for vehicle-routing problems with intermediate stops," Transportation Research Part B: Methodological, Elsevier, vol. 97(C), pages 102-112.
    24. Jothi Basu, R. & Bai, Ruibin & Palaniappan, PL.K., 2015. "A strategic approach to improve sustainability in transportation service procurement," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 74(C), pages 152-168.
    25. Gunawan, Aldy & Lau, Hoong Chuin & Vansteenwegen, Pieter, 2016. "Orienteering Problem: A survey of recent variants, solution approaches and applications," European Journal of Operational Research, Elsevier, vol. 255(2), pages 315-332.
    26. Chen, Haoxun, 2016. "Combinatorial clock-proxy exchange for carrier collaboration in less than truck load transportation," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 91(C), pages 152-172.
    27. Groves, Theodore, 1973. "Incentives in Teams," Econometrica, Econometric Society, vol. 41(4), pages 617-631, July.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Liu, Baoli & Li, Zhi-Chun & Wang, Yadong, 2022. "A two-stage stochastic programming model for seaport berth and channel planning with uncertainties in ship arrival and handling times," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 167(C).
    2. Pourhejazy, Pourya & Zhang, Dali & Zhu, Qinghua & Wei, Fangfang & Song, Shuang, 2021. "Integrated E-waste transportation using capacitated general routing problem with time-window," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 145(C).
    3. Feng, Jianghong & Xu, Su Xiu & Xu, Gangyan & Cheng, Huibing, 2022. "An integrated decision-making method for locating parking centers of recyclable waste transportation vehicles," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 157(C).
    4. Ming Wan & Ting Qu & Manna Huang & Xiaohua Qiu & George Q. Huang & Jinfu Zhu & Junrong Chen, 2022. "Cloud-Edge-Terminal-Based Synchronized Decision-Making and Control System for Municipal Solid Waste Collection and Transportation," Mathematics, MDPI, vol. 10(19), pages 1-20, September.
    5. Gharehgozli, Amir & Zaerpour, Nima, 2020. "Robot scheduling for pod retrieval in a robotic mobile fulfillment system," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 142(C).
    6. Seyfi, Majid & Alinaghian, Mahdi & Ghorbani, Erfan & Çatay, Bülent & Saeid Sabbagh, Mohammad, 2022. "Multi-mode hybrid electric vehicle routing problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 166(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Yu, Hao & Huang, Min & Chao, Xiuli & Yue, Xiaohang, 2022. "Truthful multi-attribute multi-unit double auctions for B2B e-commerce logistics service transactions," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 164(C).
    2. Lafkihi, Mariam & Pan, Shenle & Ballot, Eric, 2019. "Freight transportation service procurement: A literature review and future research opportunities in omnichannel E-commerce," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 125(C), pages 348-365.
    3. Su Xiu Xu & George Q. Huang & Meng Cheng, 2017. "Truthful, Budget-Balanced Bundle Double Auctions for Carrier Collaboration," Transportation Science, INFORMS, vol. 51(4), pages 1365-1386, November.
    4. Olli Bräysy & Michel Gendreau, 2005. "Vehicle Routing Problem with Time Windows, Part II: Metaheuristics," Transportation Science, INFORMS, vol. 39(1), pages 119-139, February.
    5. İlker Küçükoğlu & Nursel Öztürk, 2019. "A hybrid meta-heuristic algorithm for vehicle routing and packing problem with cross-docking," Journal of Intelligent Manufacturing, Springer, vol. 30(8), pages 2927-2943, December.
    6. Dellbrügge, Marius & Brilka, Tim & Kreuz, Felix & Clausen, Uwe, 2022. "Auction design in strategic freight procurement," Chapters from the Proceedings of the Hamburg International Conference of Logistics (HICL), in: Kersten, Wolfgang & Jahn, Carlos & Blecker, Thorsten & Ringle, Christian M. (ed.), Changing Tides: The New Role of Resilience and Sustainability in Logistics and Supply Chain Management – Innovative Approaches for the Shift to a New , volume 33, pages 295-325, Hamburg University of Technology (TUHH), Institute of Business Logistics and General Management.
    7. Shao, Saijun & Xu, Gangyan & Li, Ming & Huang, George Q., 2019. "Synchronizing e-commerce city logistics with sliding time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 123(C), pages 17-28.
    8. Sun, Xiaotong & Yin, Yafeng, 2021. "An auction mechanism for platoon leader determination in single-brand cooperative vehicle platooning," Economics of Transportation, Elsevier, vol. 28(C).
    9. Xu, Su Xiu & Huang, George Q., 2014. "Efficient auctions for distributed transportation procurement," Transportation Research Part B: Methodological, Elsevier, vol. 65(C), pages 47-64.
    10. Liang, Renchao & Wang, Junwei & Huang, Min & Jiang, Zhong-Zhong, 2020. "Truthful auctions for e-market logistics services procurement with quantity discounts," Transportation Research Part B: Methodological, Elsevier, vol. 133(C), pages 165-180.
    11. Xu, Su Xiu & Cheng, Meng & Huang, George Q., 2015. "Efficient intermodal transportation auctions for B2B e-commerce logistics with transaction costs," Transportation Research Part B: Methodological, Elsevier, vol. 80(C), pages 322-337.
    12. Mishra, Debasis & Parkes, David C., 2007. "Ascending price Vickrey auctions for general valuations," Journal of Economic Theory, Elsevier, vol. 132(1), pages 335-366, January.
    13. Soumyakanti Chakraborty & Anup K. Sen & Amitava Bagchi, 2015. "Addressing the valuation problem in multi-round combinatorial auctions," Information Systems Frontiers, Springer, vol. 17(5), pages 1145-1160, October.
    14. Cazzaro, Davide & Fischetti, Martina & Fischetti, Matteo, 2020. "Heuristic algorithms for the Wind Farm Cable Routing problem," Applied Energy, Elsevier, vol. 278(C).
    15. Huang, Yeran & Yang, Lixing & Tang, Tao & Gao, Ziyou & Cao, Fang, 2017. "Joint train scheduling optimization with service quality and energy efficiency in urban rail transit networks," Energy, Elsevier, vol. 138(C), pages 1124-1147.
    16. B Dengiz & C Alabas-Uslu & O Dengiz, 2009. "Optimization of manufacturing systems using a neural network metamodel with a new training approach," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(9), pages 1191-1197, September.
    17. S-W Lin & K-C Ying, 2008. "A hybrid approach for single-machine tardiness problems with sequence-dependent setup times," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(8), pages 1109-1119, August.
    18. Joseph B. Mazzola & Robert H. Schantz, 1997. "Multiple‐facility loading under capacity‐based economies of scope," Naval Research Logistics (NRL), John Wiley & Sons, vol. 44(3), pages 229-256, April.
    19. Abdmouleh, Zeineb & Gastli, Adel & Ben-Brahim, Lazhar & Haouari, Mohamed & Al-Emadi, Nasser Ahmed, 2017. "Review of optimization techniques applied for the integration of distributed generation from renewable energy sources," Renewable Energy, Elsevier, vol. 113(C), pages 266-280.
    20. Masoud Yaghini & Mohammad Karimi & Mohadeseh Rahbar, 2015. "A set covering approach for multi-depot train driver scheduling," Journal of Combinatorial Optimization, Springer, vol. 29(3), pages 636-654, April.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:transb:v:133:y:2020:i:c:p:1-20. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/548/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.