Search
Now showing items 1-10 of 271
Combining Exact and Heuristic Approaches for the Covering Salesman Problem
and heuristic approach which takes advantage of Integer Linear Programming (ILP) techniques and heuristic search to improve the quality of the solutions. Extensive computational tests on the standard benchmark instances and on a new set of large sized...
ILP-based improvement procedure for solving two variants of the standard vehicle routing problem
We develop an integer linear programming technique for solving two variants of the standard vehicle routing problem. Given an initial feasible solution to be possibly improved, the method follows a destruct-and-repair paradigm, where the given...
An Integer Linear Programming based Heuristic for the Capacitated m-Ring-Star Problem
Variable Neighborhood Search scheme, the algorithm incorporates an Integer Linear Programming based improvement method which is applied whenever the heuristic algorithm is not able to improve the quality of the current solution. Extensive computational...
Memetic and scatter search metaheuristic algorithms for a multiobjective fortnightly university course timetabling problem: a case study
, four objectives should be optimized where we used the Lp-metric method to aggregate them into a single objective. An integer linear programming model and two metaheuristic algorithms, i.e. memetic and scatter search, have been developed for the studied...
An ILP Improvement Procedure for the Open Vehicle Routing Problem
. We present a heuristic improvement procedure for OVRP based on Integer Linear Programming (ILP) techniques. Given an initial feasible solution
to be possibly improved, the method follows a destruct-and-repair paradigm, where the given solution...
An Integer Linear Programming based heuristic approach for the capacitated m-ring-star problem
of the Variable Neighborhood Search approach, the algorithm incorporates an Integer Linear Programming based improvement method which is applied whenever the heuristic procedure is not able to enhance the quality of the current solution. Extensive computational...
Fortnightly course scheduling problem: a case study
This paper studies a fortnightly university course timetabling problem. In this research, the Industrial Engineering Department of Ferdowsi University of Mashhad (Iran) is considered as the case study for investigation. An integer linear programming...
Obtaining feasible solution and optimal load shedding in contingency - constrained unit commitment joint with reserve auction
Integer Linear Programming (MILP) is used to minimize the total energy dispatch cost in 24 hours of a day. Numerical examples show that the proposed joint auction model can clear energy and ancillary services bids simultaneously while minimizing the total...
Optimal constrained power scheduling in Electricity market
Optimal constrained power scheduling in Electricity market
: Operating room scheduling under hybrid demand
including fixed cost and overtime cost). We develop an integer linear programming model for this scheduling problem. The developed model is a four dimensional assignment problem that determines the weekly schedule (day, surgeon, operating room, and type...