"A Memetic Algorithm for Finding the Two-fold Time-dependent Most Beautiful ..."

Liping Gao et al. (2019)

> Home

Details and statistics

DOI: 10.1109/WCNC.2019.8886336

access: closed

type: Conference or Workshop Paper

metadata version: 2021-04-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/wcnc/GaoCHX19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wcnc/GaoCHX19
Liping Gao, Chao Chen, Hongyu Huang, Chaocan Xiang:
A Memetic Algorithm for Finding the Two-fold Time-dependent Most Beautiful Driving Routes. WCNC 2019: 1-6

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.