A Container Loading Problem MILP-Based Heuristics Solved by CPLEX: An Experimental Analysis

With the help of accurate parking navigation systems, sharing vacant private parking spaces with public travelers may have the potential of reducing the number of cruising vehicles and contribute to traffic emission reduction. However, the quantitative effects of such a measure are still relatively unknown in traffic management. In this paper, we firstly established an optimal allocation model of shared parking spaces, which is a pure integer linear programming model of maximizing the number of served public vehicles to avoid cruising for parking. Further, the parking space allocation model was expanded to an estimation model that quantifies the effect of emission reduction. Secondly, a branch-and-cut algorithm was introduced as the core algorithm to solve the proposed models. Finally, detailed sensitivity analysis, based on empirical data collected by electronic parking toll collections and questionnaire surveys in Beijing, China, evaluated the proposed model and algorithm. The results indicate that shared parking can both effectively reduce the cruising time and the number of vehicles, but also has significantly a positive effect on emission reduction. This research is helpful to provide theoretical support for alleviating parking pressure and environmental problems.

show abstract

“…• The branch-and-cut algorithm is currently the most successful method for solving integer programs [11], [28]. • The InEq.…”

Section: Solution Techniquesmentioning

confidence: 99%

“…These inequality constraints can then be added to the linear problem, so that the next solution can be closer to the integer results. More details can be referred to reference [28].…”

Section: Solution Techniquesmentioning

confidence: 99%