Abstract
The authors formulate the transportation mixed network design problem (MNDP) as a mixed-integer bi-level mathematical problem, based on the concept of reserve capacity. The upper level goal is to maximize the reserve capacity by signal settings at intersections, determine street direction and increase street capacities via addition of lanes. The lower level problem is a deterministic user equilibrium traffic assignment problem to minimize the user travel time. The model being non-convex, meta-heuristic methods are used to solve the problem. A hybridization of genetic algorithm with simulated annealing and a bee algorithm are proposed. Numerical examples are illustrated to verify the effectiveness of the proposed model and the algorithms.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Applied Industrial Engineering
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
