We propose a global optimisation approach for the solution of various classes of bilevel programming problems (BLPP) based on recently developed parametric programming algorithms. We first describe how we can recast and solve the inner (follower’s) problem of the bilevel formulation as a multi-parametric programming problem, with parameters being the (unknown) variables of the outer (leader’s) ...

This article addresses a general tri-objective two-echelon capacitated vehicle routing problem (2E-CVRP) to minimize the total travel cost, customers waiting times and carbon dioxide emissions simultaneously in distributing perishable products. In distributing perishable products, customers’ satisfaction is very important and is inversely proportional to the customers waiting times. The propose...

Mixed-integer polynomial programming (MIPP) problems are one class of mixed-integer nonlinear programming (MINLP) problems where objective function and constraints are restricted to the polynomial functions. Although the MINLP problem is NP-hard, in special cases such as MIPP problems, an efficient algorithm can be extended to solve it. In this research, we propose an algorit...

We consider the Module Allocation Problem with Non-Uniform communication costs (MAPNU), where a set of program modules must be assigned to a set of processors. The optimal assignment minimizes the sum of execution costs and communication costs between modules. This problem is naturally formulated as a quadratic 0-1 problem with linear constraints. In this paper, we compare two exact solution me...

In this paper recently developed mixed-integer programming (MIP) tools to the problem of optimal siting and sizing of distributed generators in a distribution network. Here three methodologies for solving the DGPP via mixed-integer linear programming (MILP) and mixed-integer nonlinear programming (MINLP) approaches are compared. The single MILP approach uses the well-known DC linear approximati...