A benders decomposition algorithm for a bid generation problem in the procurement of three-echelon transportation services

DOI10.1016/J.COR.2023.106291MaRDI QIDQ6106599zbMATH OpenFDO

Authors Xiaohui Lyu, Haoxun Chen, Nengmin Wang, Zhen Yang

Publication date 3 July 2023

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.COR.2023.106291

zbMATH Keywords

benders decompositionbid generation problemcombinatorial auctionthree-echelon transportationtransportation service procurement

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Recommendations

• The stochastic bid generation problem in combinatorial transportation auctions
• A three-phase approach to solving the bidline problem
• Logic-based benders decomposition for an inter-modal transportation problem
• A Benders decomposition approach for the locomotive and car assignment problem
• A Benders decomposition for hub location problems arising in public transport
• scientific article; zbMATH DE number 3900481
• Application of Benders decomposition method in solution of a fixed-charge multicommodity network design problem avoiding congestion
• A Benders decomposition-based approach for logistics service network design

Cites work

• A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints
• A computational study of Benders decomposition for the integrated aircraft routing and crew scheduling problem
• A large neighbourhood based heuristic for two-echelon routing problems
• A multi-depot two-echelon vehicle routing problem with delivery options arising in the last mile distribution
• A multicut algorithm for two-stage stochastic linear programs
• A parallelised large neighbourhood search heuristic for the asymmetric two-echelon vehicle routing problem with swap containers for cargo-bicycles
• A tabu search for time-dependent multi-zone multi-trip vehicle routing problem with time windows
• Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
• Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests
• An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization
• An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics
• An exact algorithm for the two-echelon capacitated vehicle routing problem
• Auctions with bidder-determined allowable combinations
• Benders decomposition for large-scale uncapacitated hub location
• Benders Decomposition for Simultaneous Aircraft Routing and Crew Scheduling
• Benders decomposition for the uncapacitated multiple allocation hub location problem
• Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
• Combining Benders decomposition and column generation for multi-activity tour scheduling
• Logic-based Benders decomposition
• Metaheuristic algorithms for solving two interconnected vehicle routing problems in a hospital complex
• Partitioning procedures for solving mixed-variables programming problems
• Planning and Scheduling by Logic-Based Benders Decomposition
• The stochastic bid generation problem in combinatorial transportation auctions
• The two-echelon capacitated electric vehicle routing problem with battery swapping stations: formulation and efficient methodology
• Two-echelon vehicle routing problem with satellite bi-synchronization

Cited in

(1)

• Modelling a capacitated location problem for designing multimodal vaccine distribution network using a novel health emergency susceptibility index

This page was built for publication: A benders decomposition algorithm for a bid generation problem in the procurement of three-echelon transportation services

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6106599)