A5054669154- Supply Chain and Inventory Management
- Scheduling and Optimization Algorithms
- Vehicle Routing Optimization Methods
- Scheduling and Timetabling Solutions
- Optimization and Mathematical Programming
- Advanced Manufacturing and Logistics Optimization
- Optimization and Packing Problems
- Sustainable Supply Chain Management
- Consumer Market Behavior and Pricing
- Complex Network Analysis Techniques
- Transportation and Mobility Innovations
- Maritime Ports and Logistics
- Maritime Transport Emissions and Efficiency
- Advanced Radiotherapy Techniques
- Urban and Freight Transport Logistics
- Graph theory and applications
- Risk and Portfolio Optimization
- Aviation Industry Analysis and Trends
- Infrastructure Resilience and Vulnerability Analysis
- Maritime Navigation and Safety
- Simulation Techniques and Applications
- Healthcare Operations and Scheduling Optimization
- Optimization and Search Problems
- Advanced Control Systems Optimization
- Medical Imaging Techniques and Applications
University of Strathclyde
2016-2025
The University of Melbourne
2007-2012
University of Wisconsin–Madison
2007
This paper proposes two new mixed integer programming models for capacitated multi-level lot-sizing problems with backlogging, whose linear relaxations provide good lower bounds on the optimal solution value. We show that both of these strong formulations yield same bounds. In addition to theoretical results, we propose a new, effective optimization framework achieves high quality solutions in reasonable computational time. Computational results proposed is superior other well-known...
Despite the significant attention they have drawn, big-bucket lot-sizing problems remain notoriously difficult to solve. Previous literature contained results (computational and theoretical) indicating that what makes these are embedded single-machine, single-level, multiperiod submodels. We therefore consider simplest such submodel, a multi-item, two-period capacitated relaxation. propose methodology can approximate convex hulls of all possible relaxations by generating violated valid...
The coupled lot-sizing and cutting-stock problem has been a challenging significant for industry, therefore received sustained research attention. quality of the solution is major determinant cost performance in related production inventory management systems, there intense pressure to develop effective practical solutions. In literature, number heuristics have proposed solving problem. However, are limited obtaining high qualities. This paper proposes new progressive selection algorithm...
Due to the stricter government regulations on end-of-life product treatment and increasing public awareness towards environmental issues, remanufacturing has been a significantly growing industry over last decades, offering many potential business opportunities. In this paper, we investigate crucial problem apparent in industry, lot-sizing with separate setups. We first discuss two reformulations of problem, remark an important property regards their equivalence. Then, present theoretical...
In this paper, we investigate two-period subproblems for big-bucket lot-sizing problems, which have shown a great potential obtaining strong bounds. particular, the special case of zero setup times and identify two important mixed integer sets representing relaxations these subproblems. We analyze polyhedral structure sets, deriving several families valid inequalities presenting their facet-defining conditions. then extend in novel fashion to original space subproblems, also propose new...
The distance-based critical node problem involves identifying a subset of nodes in network whose removal minimises pre-defined connectivity measure. Having the classical as special case, is computationally challenging. In this article, we study from heuristic algorithm perspective. We consider objective goal to minimise number pairs connected by path length at most k, subject budgetary constraints. propose centrality based which combines backbone-based crossover procedure generate good...