An efficient environmentally friendly transportation network design via dry ports: a bi-level programming approach

DOI10.1007/S10479-022-05117-0MaRDI QIDQ6160968zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

air pollutionbi-level programmingmatheuristic algorithmdirect connectiondry ports

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)

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

Cites work

• A dynamic programming-based matheuristic for the dynamic berth allocation problem
• A matheuristic based on large neighborhood search for the vehicle routing problem with cross-docking
• A matheuristic for the discrete bilevel problem with multiple objectives at the lower level
• A study on the use of heuristics to solve a bilevel programming problem
• Adaptive large neighborhood decomposition search algorithm for multi-allocation hub location routing problem
• An efficient matheuristic for the robust multiple allocation p-hub median problem under polyhedral demand uncertainty
• An implicit enumeration algorithm for the hub interdiction median problem with fortification
• Benders decomposition applied to a robust multiple allocation incomplete hub location problem
• Dantzig-Wolfe decomposition approach to the vehicle assignment problem with demand uncertainty in a hybrid hub-and-spoke network
• Hub location under competition
• Integrating matheuristics and metaheuristics for timetabling
• KKT reformulation and necessary conditions for optimality in nonsmooth bilevel optimization
• Matheuristics for the capacitated p-Median problem
• Matheuristics for the single-path design-balanced service network design problem
• Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources
• Network hub location problems: The state of the art
• New models for the location of controversial facilities: a bilevel programming approach
• On the Karush-Kuhn-Tucker reformulation of the bilevel optimization problem
• Planning and design of intermodal hub networks: a literature review
• Solving bilevel programs with the KKT-approach
• Solving the \(p\)-hub median problem under intentional disruptions using simulated annealing
• Stochastic single-allocation hub location
• Stochastic uncapacitated hub location
• The Mixed Integer Linear Bilevel Programming Problem
• Tight linear programming relaxations of uncapacitated p-hub median problems

Cited in

(2)

• Location of dry ports based on node importance of complex network
• Metaheuristics for bilevel optimization: a comprehensive review

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)