An efficient environmentally friendly transportation network design via dry ports: a bi-level programming approach
From MaRDI portal
Publication:6160968
DOI10.1007/s10479-022-05117-0zbMath1517.90077OpenAlexW4312222686MaRDI QIDQ6160968
Benny Tjahjono, Mahdi Bashiri, Mehdi Seifbarghy, Elham Ziar
Publication date: 26 June 2023
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-022-05117-0
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (1)
Cites Work
- Solving the \(p\)-hub median problem under intentional disruptions using simulated annealing
- Hub location under competition
- Integrating matheuristics and metaheuristics for timetabling
- Stochastic uncapacitated hub location
- On the Karush-Kuhn-Tucker reformulation of the bilevel optimization problem
- Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
- Dantzig-Wolfe decomposition approach to the vehicle assignment problem with demand uncertainty in a hybrid hub-and-spoke network
- Matheuristics for the single-path design-balanced service network design problem
- A matheuristic based on large neighborhood search for the vehicle routing problem with cross-docking
- Benders decomposition applied to a robust multiple allocation incomplete hub location problem
- An efficient matheuristic for the robust multiple allocation \(p\)-hub median problem under polyhedral demand uncertainty
- New models for the location of controversial facilities: a bilevel programming approach
- Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources
- An implicit enumeration algorithm for the hub interdiction median problem with fortification
- Solving bilevel programs with the KKT-approach
- Stochastic single-allocation hub location
- A dynamic programming-based matheuristic for the dynamic berth allocation problem
- Network hub location problems: The state of the art
- Planning and design of intermodal hub networks: a literature review
- Adaptive large neighborhood decomposition search algorithm for multi-allocation hub location routing problem
- A study on the use of heuristics to solve a bilevel programming problem
- The Mixed Integer Linear Bilevel Programming Problem
- KKT Reformulation and Necessary Conditions for Optimality in Nonsmooth Bilevel Optimization
- Matheuristics for the capacitated p‐median problem
- A matheuristic for the discrete bilevel problem with multiple objectives at the lower level
This page was built for publication: An efficient environmentally friendly transportation network design via dry ports: a bi-level programming approach
