Berth Allocation Problem with Rectangle Packing
Berth Allocation Problem (BAP) The berth allocation problem assigns arriving ships to a section of the berth (where, when & how long) during enough time for the loading and unloading…
Berth Allocation Problem (BAP) The berth allocation problem assigns arriving ships to a section of the berth (where, when & how long) during enough time for the loading and unloading…
As ship sizes continue raise, ports struggle maintaining and hopefully increasing port operations productivity. The large number of berths, cranes, warehouses and labors they need to handle make the operations…
The Unit Commitment Problem (UCP) The Unit Commitment problem (UCP) consists in deciding which power generators to run, in which periods and at what level in order to satisfy the…
Facility location problem may be the most critical and most difficult in Supply Chain Network Design because the facilities are often fixed and difficult to relocate in the short term.…
Line Balancing Problem In a previous post we introduced various models for the mixed-model sequencing problem (MMSP), which consists in sequencing models to be produced in an assembly line that…
Assembly lines are manufacturing facilities where the work stations are fixed and the products being assembled move from station to station. The assembly line balancing problem (ALBP) consists in defining…
More MIP models for the asymmetric TSP In a previous blog post Traveling Salesman Problem (TSP) with Miller-Tucker-Zemlin (MTZ) in CPLEX/OPL we presented the MTZ model for the asymmetric TSP…
Have you ever wondered how garbage collectors visit thousands of homes all over a city in a single day? Or how Pos Malaysia delivers packages so efficiently? Ahmad is working…
Back to 1997 Heuristics were the safe bet Heuristics are the main tool used to solve optimisation problems in the industry. Initially, heuristic localsearch algorithms were often used. Airline crew…