A novel approach to discrete truss design problems using mixed integer neighborhood search

2018 ◽  
Vol 58 (6) ◽  
pp. 2411-2429 ◽  
Author(s):  
Mohammad Shahabsafa ◽  
Ali Mohammad-Nezhad ◽  
Tamás Terlaky ◽  
Luis Zuluaga ◽  
Sicheng He ◽  
...  
Keyword(s):  
Mixed Integer ◽  
Neighborhood Search ◽  
Design Problems ◽  
Truss Design ◽  
Novel Approach

scholarly journals Improved Simulated Annealing Based Network Model for E-Recycling Reverse Logistics Decisions under Uncertainty

2018 ◽  
Vol 2018 ◽  
pp. 1-17
Author(s):  
Lei Wang ◽  
Mark Goh ◽  
Ronggui Ding ◽  
Vikas Kumar Mishra
Keyword(s):  
Simulated Annealing ◽  
Reverse Logistics ◽  
Electronic Waste ◽  
Neighborhood Search ◽  
Generation Process ◽  
Candidate Solution ◽  
Novel Approach ◽  
Numerical Experimentation ◽  
The Government ◽  
Quantitative Importance

Electronic waste recycle (e-recycling) is gaining increasing importance due to greater environmental concerns, legislation, and corporate social responsibility. A novel approach is explored for designing the e-recycling reverse logistics network (RLN) under uncertainty. The goal is to obtain a solution, i.e., increasing the storage capacity of the logistics node, to achieve optimal or near-optimal profit under the collection requirement set by the government and the investment from the enterprise. The approach comprises two parts: a matrix-based simulation model of RLN formed for the uncertainty of demand and reverse logistics collection which calculates the profit under a given candidate solution and simulated annealing (SA) algorithm that is tailored to generating solution using the output of RLN model. To increase the efficiency of the SA algorithm, network static analysis is proposed for getting the quantitative importance of each node in RLN, including the static network generation process and index design. Accordingly, the quantitative importance is applied to increase the likelihood of generating a better candidate solution in the neighborhood search of SA. Numerical experimentation is conducted to validate the RLN model as well as the efficiency of the improved SA.

scholarly journals Optimising Daily Fantasy Sports Teams with Artificial Intelligence

2020 ◽  
Vol 19 (2) ◽  
pp. 21-35
Author(s):  
Ryan Beal ◽  
Timothy J. Norman ◽  
Sarvapali D. Ramchurn
Keyword(s):  
Real World ◽  
National Football League ◽  
Mixed Integer ◽  
Data Sets ◽  
Fantasy Sports ◽  
Real World Data ◽  
Sports Teams ◽  
Novel Approach ◽  
Four Seasons ◽  
Daily Fantasy Sports

AbstractThis paper outlines a novel approach to optimising teams for Daily Fantasy Sports (DFS) contests. To this end, we propose a number of new models and algorithms to solve the team formation problems posed by DFS. Specifically, we focus on the National Football League (NFL) and predict the performance of real-world players to form the optimal fantasy team using mixed-integer programming. We test our solutions using real-world data-sets from across four seasons (2014-2017). We highlight the advantage that can be gained from using our machine-based methods and show that our solutions outperform existing benchmarks, turning a profit in up to 81.3% of DFS game-weeks over a season.

scholarly journals Hub location problem in round-trip service applications

2020 ◽  
Author(s):  
Omar Kemmar ◽  
Karim Bouamrane ◽  
Shahin Gelareh
Keyword(s):  
Economies Of Scale ◽  
Location Problem ◽  
Service Providers ◽  
Real Life ◽  
Mixed Integer ◽  
Neighborhood Search ◽  
Hub Location ◽  
Service Networks ◽  
Hub Location Problem ◽  
Hub And Spoke

In this paper, we introduce a new hub-and-spoke structure for service networks based on round-trips as practiced by some transport service providers. This problem is a variant of Uncapacitated Hub Location Problem wherein the spoke nodes allocated to a hub node form round-trips (cycles) starting from and ending to the hub node. This problem is motivated by two real-life practices in logistics wherein  runaway  nodes and  runaway  connections with their associated economies of scale were foreseen to increase redundancy in the network. We propose a mixed integer linear programming mathematical model with exponential number of constraints. In addition to the separation routines for separating from among exponential constraints, we propose a hyper-heuristic based on reinforcement learning and its comparable counterpart as a variable neighborhood search. Our extensive computational experiments confirm efficiency of the proposed approaches.In this paper, we introduce a new hub-and-spoke structure for service networks based on round-trips as practiced by some transport service providers. This problem is a variant of Uncapacitated Hub Location Problem wherein the spoke nodes allocated to a hub node form round-trips (cycles) starting from and ending to the hub node. This problem is motivated by two real-life practices in logistics wherein  runaway  nodes and  runaway  connections with their associated economies of scale were foreseen to increase redundancy in the network. We propose a mixed integer linear programming mathematical model with exponential number of constraints. In addition to the separation routines for separating from among exponential constraints, we propose a hyper-heuristic based on reinforcement learning and its comparable counterpart as a variable neighborhood search. Our extensive computational experiments confirm efficiency of the proposed approaches.

Nonlinear Mixed Integer-Discrete-Continuous Programming and its Application to Engineering Design Problems

1989 ◽  
Author(s):  
J.-F. Fu ◽  
R. G. Fenton ◽  
W. L. Cleghorn
Keyword(s):  
Nonlinear Programming ◽  
Objective Function ◽  
Engineering Design ◽  
Optimization Algorithm ◽  
Mixed Integer ◽  
Continuous Variables ◽  
Design Problems ◽  
Continuous Programming ◽  
Engineering Design Problems ◽  
Standard Values

Abstract An algorithm for solving nonlinear programming problems containing integer, discrete and continuous variables is presented. Based on a commonly employed optimization algorithm, penalties on integer and/or discrete violations are imposed on the objective function to force the search to converge onto standard values. Examples are included to illustrate the practical use of this algorithm.

scholarly journals Multi-Objective Sustainable Truck Scheduling in a Rail–Road Physical Internet Cross-Docking Hub Considering Energy Consumption

2019 ◽  
Vol 11 (11) ◽  
pp. 3127 ◽  
Author(s):  
Tarik Chargui ◽  
Abdelghani Bekrar ◽  
Mohamed Reghioui ◽  
Damien Trentesaux
Keyword(s):  
Energy Consumption ◽  
Programming Model ◽  
Mixed Integer ◽  
Computational Time ◽  
Neighborhood Search ◽  
Optimal Solutions ◽  
Multi Objective ◽  
Sustainable Logistics ◽  
Cross Docking ◽  
Physical Internet

In the context of supply chain sustainability, Physical Internet (PI or π ) was presented as an innovative concept to create a global sustainable logistics system. One of the main components of the Physical Internet paradigm consists in encapsulating products in modular and standardized PI-containers able to move via PI-nodes (such as PI-hubs) using collaborative routing protocols. This study focuses on optimizing operations occurring in a Rail–Road PI-Hub cross-docking terminal. The problem consists of scheduling outbound trucks at the docks and the routing of PI-containers in the PI-sorter zone of the Rail–Road PI-Hub cross-docking terminal. The first objective is to minimize the energy consumption of the PI-conveyors used to transfer PI-containers from the train to the outbound trucks. The second objective is to minimize the cost of using outbound trucks for different destinations. The problem is formulated as a Multi-Objective Mixed-Integer Programming model (MO-MIP) and solved with CPLEX solver using Lexicographic Goal Programming. Then, two multi-objective hybrid meta-heuristics are proposed to enhance the computational time as CPLEX was time consuming, especially for large size instances: Multi-Objective Variable Neighborhood Search hybridized with Simulated Annealing (MO-VNSSA) and with a Tabu Search (MO-VNSTS). The two meta-heuristics are tested on 32 instances (27 small instances and 5 large instances). CPLEX found the optimal solutions for only 23 instances. Results show that the proposed MO-VNSSA and MO-VNSTS are able to find optimal and near optimal solutions within a reasonable computational time. The two meta-heuristics found optimal solutions for the first objective in all the instances. For the second objective, MO-VNSSA and MO-VNSTS found optimal solutions for 7 instances. In order to evaluate the results for the second objective, a one way analysis of variance ANOVA was performed.

scholarly journals A Study on Scalable Representations for Evolutionary Optimization of Ground Structures

2012 ◽  
Vol 20 (3) ◽  
pp. 453-472 ◽  
Author(s):  
Alexandre Devert ◽  
Thomas Weise ◽  
Ke Tang
Keyword(s):  
State Of The Art ◽  
Computational Cost ◽  
Global Optimum ◽  
Design Parameters ◽  
Optimization Scheme ◽  
Design Problems ◽  
Truss Design ◽  
Objective Value ◽  
Ground Structures ◽  
2D Space

This paper presents a comparative study of two indirect solution representations, a generative and an ontogenic one, on a set of well-known 2D truss design problems. The generative representation encodes the parameters of a trusses design as a mapping from a 2D space. The ontogenic representation encodes truss design parameters as a local truss transformation iterated several times, starting from a trivial initial truss. Both representations are tested with a naive evolution strategy based optimization scheme, as well as the state of the art HyperNEAT approach. We focus both on the best objective value obtained and the computational cost to reach a given level of optimality. The study shows that the two solution representations behave very differently. For experimental settings with equal complexity, with the same optimization scheme and settings, the generative representation provides results which are far from optimal, whereas the ontogenic representation delivers near-optimal solutions. The ontogenic representation is also much less computationally expensive than a direct representation until very close to the global optimum. The study questions the scalability of the generative representations, while the results for the ontogenic representation display much better scalability.

A Project-Oriented Radar Systems Course: A Novel Experiment in Cooperative Pedagogy

1992 ◽  
Vol 29 (1) ◽  
pp. 42-46 ◽  
Author(s):  
Ram M. Narayanan ◽  
Jack Holt ◽  
Edward Abel
Keyword(s):  
Air Force ◽  
Real World ◽  
Technical Writing ◽  
Design Problems ◽  
Design Project ◽  
Radar Systems ◽  
Novel Approach ◽  
Approach To Teaching

A project-orientated radar systems course: a novel experiment in co-operative pedagogy This paper describes a novel approach to teaching a course on radar systems. The course contained a radar design project that was assigned, monitored and evaluated by U.S. Air Force personnel. Students obtained useful experience in ‘real-world’ design problems, team effort, technical writing and presentation. Similar cooperative ventures are recommended.

Design of a post-disaster shelter through soft computing

2019 ◽  
Vol 17 (2) ◽  
pp. 185-205 ◽  
Author(s):  
Füsun Cemre Karaoğlan ◽  
Sema Alaçam
Keyword(s):  
Soft Computing ◽  
Architectural Design ◽  
Low Cost ◽  
Computing Methods ◽  
Modular System ◽  
Design Problems ◽  
Novel Approach ◽  
Fuzzy Neural ◽  
Experiential Quality ◽  
Post Disaster

Temporary shelters become a more critical subject of architectural design as the increasing number of natural disasters taking place each year result in a larger number of people in need of urgent sheltering. Therefore, this project focuses on designing a temporary living space that can respond to the needs of different post-disaster scenarios and form a modular system through differentiation of units. When designing temporary shelters, it is a necessity to deal with the provision of materials, low-cost production and the time limit in the emergency as well as the needs of the users and the experiential quality of the space. Although computational approaches might lead to much more efficient and resilient design solutions, they have been utilized in very few examples. For that reason and due to their suitability to work with architectural design problems, soft computing methods shape the core of the methodology of the study. Initially, a digital model is generated through a set of rules that define a growth algorithm. Then, Multi-Objective Genetic Algorithms alter this growth algorithm while evaluating different configurations through the objective functions constructed within a Fuzzy Neural Tree. The struggle to represent design goals in the form of Fuzzy Neural Tree holds potential for the further use of it for architectural design problems centred on resilience. Resilience in this context is defined as a measure of how agile a design is when dealing with a major sheltering need in a post-disaster environment. Different from the previous studies, this article aims to focus on the design of a temporary shelter that can respond to different user types and disaster scenarios through mass customization, using Fuzzy Neural Tree as a novel approach. While serving as a temporary space, the design outcomes are expected to create a more neighbourhood-like pattern with a stronger sense of community for the users compared to the previous examples.

Sign in / Sign up

Export Citation Format

Share Document