An efficient environmentally friendly transportation network design via dry ports: a bi-level programming approach
DOI10.1007/S10479-022-05117-0zbMATH Open1517.90077OpenAlexW4312222686MaRDI QIDQ6160968FDOQ6160968
Authors: Elham Ziar, Mehdi Seifbarghy, Mahdi Bashiri, Benny Tjahjono 
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
Recommendations
- An alternative approach for solving the environmentally-oriented discrete network design problem
- The Design of a Hierarchical Transportation Network with Transshipment Facilities
- Bilevel programming model and solution method for mixed transportation network design problem
- Finding efficient and environmentally friendly paths for risk-averse freight carriers
- The liner shipping routing and scheduling problem under environmental considerations: the case of emissions control areas
- scientific article; zbMATH DE number 3922335
Approximation methods and heuristics in mathematical programming (90C59) Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)
Cites Work
- Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
- Solving bilevel programs with the KKT-approach
- Network hub location problems: The state of the art
- Solving the \(p\)-hub median problem under intentional disruptions using simulated annealing
- Stochastic uncapacitated hub location
- KKT reformulation and necessary conditions for optimality in nonsmooth bilevel optimization
- The Mixed Integer Linear Bilevel Programming Problem
- Hub location under competition
- An implicit enumeration algorithm for the hub interdiction median problem with fortification
- On the Karush-Kuhn-Tucker reformulation of the bilevel optimization problem
- Integrating matheuristics and metaheuristics for timetabling
- Stochastic single-allocation hub location
- A dynamic programming-based matheuristic for the dynamic berth allocation problem
- New models for the location of controversial facilities: a bilevel programming approach
- Matheuristics for the capacitated p-Median problem
- Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources
- Dantzig-Wolfe decomposition approach to the vehicle assignment problem with demand uncertainty in a hybrid hub-and-spoke network
- A matheuristic based on large neighborhood search for the vehicle routing problem with cross-docking
- Matheuristics for the single-path design-balanced service network design problem
- 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
- Adaptive large neighborhood decomposition search algorithm for multi-allocation hub location routing problem
- Planning and design of intermodal hub networks: a literature review
- A study on the use of heuristics to solve a bilevel programming problem
- A matheuristic for the discrete bilevel problem with multiple objectives at the lower level
Cited In (2)
This page was built for publication: An efficient environmentally friendly transportation network design via dry ports: a bi-level programming approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6160968)
