Mathematical Modelling and a Meta-heuristic for Cross Border Supply Chain Network of Re-configurable Facilities

In supply chain management (SCM), Facility location-allocation problem (FLAP) comes under strategic planning and has been a well-established research area within Operations Research (OR). Owing to the billion dollar trade between USA-Canada the supply chain costs and difficulties are growing. Binary Integer Linear Programming (BILP) mathematical model is formulated to incorporate several parameters which would optimize the overall supply chain cost. Capacitated, single commodity, multiple time period (dynamic) and multi-facility location allocation problem is considered. Canada being a part of “The Kyoto protocol”, a part of the United Nations Framework Convention on Climate Change, has declared to abide by global effort to reduce GHG emissions. Developed math model will include an important constraint to optimize production keeping the Carbon di-oxide gas [��2] emission levels within specified limits. Simulated annealing based Meta-heuristic is developed to solve the problem to near optimality

Combinatorial Optimization

This report summarizes the meeting on Combinatorial Optimization where new and promising developments in the field were discussed. Th

Advances and Novel Approaches in Discrete Optimization

Discrete optimization is an important area of Applied Mathematics with a broad spectrum of applications in many fields. This book results from a Special Issue in the journal Mathematics entitled ‘Advances and Novel Approaches in Discrete Optimization’. It contains 17 articles covering a broad spectrum of subjects which have been selected from 43 submitted papers after a thorough refereeing process. Among other topics, it includes seven articles dealing with scheduling problems, e.g., online scheduling, batching, dual and inverse scheduling problems, or uncertain scheduling problems. Other subjects are graphs and applications, evacuation planning, the max-cut problem, capacitated lot-sizing, and packing algorithms

Multi-plant capacitated lot sizing problem

The datasets for the papers "Lagrangian heuristics for the capacitated multi-plant lot sizing problem with multiple periods and items", and "A kernel search to the multi-plant capacitated lot sizing problem with setup carry-over", both submitted to the Computers & Operations Research, are available here. Please refer to the file "readme.txt" for information on how to interpret each dataset. The results reported in both papers summarize those presented in the spreadsheets given as a Related Link

A Polyhedral Study of Mixed 0-1 Set

We consider a variant of the well-known single node fixed charge network flow set with constant capacities. This set arises from the relaxation of more general mixed integer sets such as lot-sizing problems with multiple suppliers. We provide a complete polyhedral characterization of the convex hull of the given set