Liang Xu

ORCID: 0000-0002-7004-4979
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Vehicle Routing Optimization Methods
  • Optimization and Packing Problems
  • Maritime Navigation and Safety
  • Risk and Portfolio Optimization
  • Optimization and Search Problems
  • Transportation and Mobility Innovations
  • Supply Chain and Inventory Management
  • Advanced Manufacturing and Logistics Optimization
  • Robotic Path Planning Algorithms
  • Optimization and Mathematical Programming
  • Metaheuristic Optimization Algorithms Research
  • Marine and Coastal Research
  • Smart Parking Systems Research
  • Financial Markets and Investment Strategies
  • Air Traffic Management and Optimization
  • Healthcare Operations and Scheduling Optimization
  • Advanced DC-DC Converters
  • Advanced Multi-Objective Optimization Algorithms
  • Digitalization and Economic Development in Agriculture
  • Scheduling and Timetabling Solutions
  • Technology and Human Factors in Education and Health
  • Military Defense Systems Analysis
  • Vehicle Dynamics and Control Systems
  • Stochastic processes and financial applications
  • Power Line Inspection Robots

Southwestern University of Finance and Economics
2013-2024

Systems Engineering Society of China
2022

Hong Kong Polytechnic University
2009-2021

China Three Gorges University
2021

Beihang University
2008-2019

Kagawa University
2015

State Key Laboratory of Automotive Simulation and Control
2014

Jilin University
2014

Problem definition: For the standard newsvendor problem with an unknown demand distribution, we develop approach that uses data input to construct a distribution ambiguity set nonparametric characteristics of true and use it make robust decisions. Academic/practical relevance: Empirical relies on historical estimate distribution. Although estimated converges its performance limited is not guaranteed. Our generates decisions from constructed by data-driven estimators for includes desired...

10.1287/msom.2020.0961 article EN Manufacturing & Service Operations Management 2021-03-18

Abstract This article studies a min‐max path cover problem, which is to determine set of paths for k capacitated vehicles service all the customers in given weighted graph so that largest cost minimized. The problem has wide applications vehicle routing, especially when minimization latest completion time critical performance measure. We have analyzed four typical variants this where either unlimited or limited capacities, and they start from depot any set. developed approximation algorithms...

10.1002/nav.20434 article EN Naval Research Logistics (NRL) 2010-10-28

Forecasting stock returns is extremely challenging in general, and this task becomes even more difficult given the turbulent nature of Chinese market. We address selection process as a statistical learning problem build cross-sectional forecast models to select individual stocks Shanghai Composite Index. Decile portfolios are formed according rankings forecasted future cumulative returns. The equity market's neutral portfolio—formed by buying top decile portfolio selling short bottom...

10.1186/s40854-019-0137-1 article EN cc-by Financial Innovation 2019-04-29

A hybrid physics-machine learning modeling framework is proposed for the surface vehicles' maneuvering motions to address capability and stability in presence of environmental disturbances. From a deep perspective, based on variant version residual networks with additional feature extraction. Initially, an imperfect physical model derived identified capture fundamental hydrodynamic characteristics marine vehicles. This then integrated feedforward network through block. Additionally,...

10.48550/arxiv.2411.13908 preprint EN arXiv (Cornell University) 2024-11-21

Global path planning is the key technology in design of unmanned surface vehicles. This paper establishes global environment modelling based on electronic charts and hexagonal grids which are proved to be better than square validity, safety rapidity. Besides, we introduce Cube coordinate system simplify algorithms. Furthermore, propose an improved A* algorithm realise between two points. Based that, build for multiple task points present ant colony optimisation it accurately. The simulation...

10.1504/ijvas.2018.093119 article EN International Journal of Vehicle Autonomous Systems 2018-01-01

Classic portfolio selection problems mainly focus on high-risk financial markets with tradeoffs between returns and risk. However, more risk-averse investors pursue long-term planning the objectives of maximizing final flexibility. This article addresses a new type problem, called periodic investment (PIPSPs), in which periodically allocate resources to products different periods. A multiobjective model for PIPSPs is first presented. With mechanism utilizing data generated during...

10.1109/tcyb.2021.3108977 article EN IEEE Transactions on Cybernetics 2021-09-20

We consider optimal pricing and manufacturing control of a continuous-review inventory system with remanufacturing. Customer demand product return follow independent Poisson processes. is filled by serviceable product, which can be either manufactured or remanufactured from the returned product. The lead times for both remanufacturing are exponentially distributed. objective to maximize expected total discounted profit over an infinite planning horizon. characterize structural properties...

10.1155/2015/789306 article EN Mathematical Problems in Engineering 2015-01-01

A new problem arises when an automated guided vehicle (AGV) is dispatched to visit a set of customers, which are usually located along fixed wire transmitting signal navigate the AGV. An optimal visiting sequence desired with objective minimizing total travelling distance (or time). When precedence constraints restricted on referred as traveling salesman path (TSPP-PC). Whether or not it NP-complete has no answer in literature. In this paper, we design dynamic programming for TSPP-PC, first...

10.1155/2016/5040513 article EN Mathematical Problems in Engineering 2016-01-01

This paper proposes new operational profiles which include users' total operate time, average time and frequency in addition to probability for complex combinations of functions. Also, this describes the method create test suite based on combination status by using example system. The discribes can strategy engineer charge make.

10.1109/snpd.2015.7176272 article EN 2015-06-01

A multidepot capacitated vehicle routing problem aims to serve customers’ demands using a fleet of vehicles located in multiple depots, such that the total travel cost is minimized. We study variant this problem, k-depot split delivery (or k-DSDVRP short), for situation where each customer’s demand can be served by more than one vehicle, and number denoted [Formula: see text], fixed constant. This challenging with broad applications logistics industry, which no constant ratio approximation...

10.1287/ijoc.2021.0193 article EN INFORMS journal on computing 2023-05-25

In order to track aerial target using data from radars, we improved an adaptive extended Kalman filtering algorithm based on "Current" Statistical Model. this algorithm, the interval of acceleration probability distribution is adjusted, and Singer model adopted instead Model when in low-level maneuver. According real-time estimation its change rate, self-adaption extremum achieved. Based Monte Carlo simulation, got conclusion that different maneuver situation can be tracked quickly,...

10.1117/12.806723 article EN Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE 2008-10-10
Coming Soon ...