A cutting stock problem is one of the main and classical problems in operations research that is modeled as LP problem. Because of its NP-hard nature, finding an optimal solution in reasonable time is extremely difficult and at least non-economical. In this paper, two meta-heuristic algorithms,...

A cutting stock problem is one of the main and classical problems in operations research that is modeled as LP problem. Because of its NP-hard nature, finding an optimal solution in reasonable time is extremely difficult and at least non-economical. In this paper, two meta-heuristic algorithms,...

This article describes how a vehicular ad-hoc network (VANET) is an infrastructureless network in which vehicles are connected without wires. Routing in VANET is challenging nowadays due to increased number of a vehicle, the high mobility of nodes, dynamically changing topology and highly...

In this paper, evacuation dynamics in an office building is studied by experiment and simulation. A lattice gas (LG) model is developed. A parameter called ‘exit bias’ is introduced into the model to describe the occupants’ familiarity with different exits in a building. The evacuation...

A highly automated, real-time dispatch system is described which uses embedded optimization routines to replace extensive manual operations and to reduce substantially operating costs for a nation-wide fleet of petroleum tank trucks. The system is currently used in daily operations by the Order...