scholarly journals Solving the Max-Diversity Orthogonal Regrouping Problem by an Integer Linear Programming Model and a GRASP/VND with Path-Relinking Approach

Symmetry ◽  
2021 ◽  
Vol 14 (1) ◽  
pp. 18
Author(s):  
Eduardo Canale ◽  
Franco Robledo ◽  
Pablo Sartor ◽  
Luis Stábile
Keyword(s):  
Linear Programming ◽  
Integer Linear Programming ◽  
Programming Model ◽  
Path Relinking ◽  
Master Of Business Administration ◽  
Adaptive Search ◽  
Variable Neighborhood Descent ◽  
Mba Programs ◽  
Peer Network ◽  
High Diversity

Students from Master of Business Administration (MBA) programs are usually split into teams. In light of the generalistic nature of MBA programs, diversity within every team is desirable in terms of gender, major, age and other criteria. Many schools rotate the teams at the beginning of every term so that each student works with a different set of peers during every term, thus training his or her adaptation skills and expanding the peer network. Achieving diverse teams while avoiding–or minimizing—the repetition of student pairs is a complex and time-consuming task for MBA Directors. We introduce the Max-Diversity Orthogonal Regrouping (MDOR) problem to manage the challenge of splitting a group of people into teams several times, pursuing the goals of high diversity and few repetitions. We propose a hybrid Greedy Randomized Adaptive Search Procedure/Variable Neighborhood Descent (GRASP/VND) heuristic combined with tabu search and path relinking for its resolution, as well as an Integer Linear Programming (ILP) formulation. We compare both approaches through a set of real MBA cohorts, and the results show that, in all cases, the heuristic approach significantly outperforms the ILP and manually formed teams in terms of both diversity and repetition levels.

scholarly journals A Mixed Integer Linear Programming Method for Simultaneous Multi-Periodic Train Timetabling and Routing on a High-Speed Rail Network

2020 ◽  
Vol 12 (3) ◽  
pp. 1131
Author(s):  
Wenliang Zhou ◽  
Xiaorong You ◽  
Wenzhuang Fan
Keyword(s):  
Linear Programming ◽  
Integer Linear Programming ◽  
Mixed Integer Linear Programming ◽  
High Speed ◽  
Programming Model ◽  
Mixed Integer ◽  
High Speed Rail ◽  
Train Timetabling ◽  
Train Timetable ◽  
The Impact

To avoid conflicts among trains at stations and provide passengers with a periodic train timetable to improve service level, this paper mainly focuses on the problem of multi-periodic train timetabling and routing by optimizing the routes of trains at stations and their entering time and leaving time on each chosen arrival–departure track at each visited station. Based on the constructed directed graph, including unidirectional and bidirectional tracks at stations and in sections, a mixed integer linear programming model with the goal of minimizing the total travel time of trains is formulated. Then, a strategy is introduced to reduce the number of constraints for improving the solved efficiency of the model. Finally, the performance, stability and practicability of the proposed method, as well as the impact of some main factors on the model are analyzed by numerous instances on both a constructed railway network and Guang-Zhu inter-city railway; they are solved using the commercial solver WebSphere ILOG CPLEX (International Business Machines Corporation, New York, NY, USA). Experimental results show that integrating multi-periodic train timetabling and routing can be conducive to improving the quality of a train timetable. Hence, good economic and social benefits for high-speed rail can be achieved, thus, further contributing to the sustained development of both high-speed railway systems and society.

scholarly journals Minimising negative externalities cost using 0-1 mixed integer linear programming model in e-commerce environment

2017 ◽  
Vol 11 ◽  
Author(s):  
Akyene Tetteh ◽  
Sarah Dsane-Nsor
Keyword(s):  
Linear Programming ◽  
Integer Linear Programming ◽  
Mixed Integer Linear Programming ◽  
Programming Model ◽  
Petroleum Products ◽  
Mixed Integer ◽  
The Internet ◽  
Negative Externalities ◽  
The Government ◽  
The Cost

Background: Although the Internet boosts business profitability, without certain activities like efficient transportation, scheduling, products ordered via the Internet may reach their destination very late. The environmental problems (vehicle part disposal, carbon monoxide [CO], nitrogen oxide [NOx] and hydrocarbons [HC]) associated with transportation are mostly not accounted for by industries.Objectives: The main objective of this article is to minimising negative externalities cost in e-commerce environments.Method: The 0-1 mixed integer linear programming (0-1 MILP) model was used to model the problem statement. The result was further analysed using the externality percentage impact factor (EPIF).Results: The simulation results suggest that (1) The mode of ordering refined petroleum products does not impact on the cost of distribution, (2) an increase in private cost is directly proportional to the externality cost, (3) externality cost is largely controlled by the government and number of vehicles used in the distribution and this is in no way influenced by the mode of request (i.e. Internet or otherwise) and (4) externality cost may be reduce by using more ecofriendly fuel system.

scholarly journals Combining an Extended SMAA-2 Method with Integer Linear Programming for Task Assignment of Multi-UCAV under Multiple Uncertainties

Symmetry ◽  
2018 ◽  
Vol 10 (11) ◽  
pp. 587 ◽  
Author(s):  
Jun Wang ◽  
Pengcheng Luo ◽  
Xinwu Hu ◽  
Xiaonan Zhang
Keyword(s):  
Linear Programming ◽  
Integer Linear Programming ◽  
Programming Model ◽  
Task Assignment ◽  
Target Information ◽  
Interval Numbers ◽  
Weighted Arithmetic ◽  
Assignment Model ◽  
Arithmetic Averaging Operator ◽  
Multiple Uncertainties

Uncertainty should be taken into account when establishing multiobjective task assignment models for multiple unmanned combat aerial vehicles (UCAVs) due to errors in the target information acquired by sensors, implicit preferences of the commander for operational objectives, and partially known weights of sensors. In this paper, we extend the stochastic multicriteria acceptability analysis-2 (SMAA-2) method and combine it with integer linear programming to achieve multiobjective task assignment for multi-UCAV under multiple uncertainties. We first represent the uncertain target information as normal distribution interval numbers so that the values of criteria (operational objectives) concerned can be computed based on the weighted arithmetic averaging operator. Thus, we obtain multiple criteria value matrices for each UCAV. Then, we propose a novel aggregation method to generate the final criteria value matrix based on which the holistic acceptability indices are computed by the extended SMAA-2 method. On this basis, we convert the task assignment model with uncertain parameters into an integer linear programming model without uncertainty so as to implement task assignment using the integer linear programming method. Finally, we conduct a case study and demonstrate the feasibility of the proposed method in solving the multiobjective task assignment problem multi-UCAV under multiple uncertainties.

Sign in / Sign up

Export Citation Format

Share Document